Maximal Independent Sets of a Hypergraph IJCAI01.

Slides:

Advertisements

Similar presentations

Equations as Relations y = 2x is an equation with 2 variables When you substitute an ordered pair into an equation with 2 variables then the ordered pair.

Advertisements

Linear Programming. Businesses use linear programming to find out how to maximize profit or minimize costs. Most have constraints on what they can use.

Problem Reformulation and Search

Non-Binary Constraint Satisfaction Toby Walsh Cork Constraint Computation Center.

Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.

A Study of 0/1 Encodings Prosser & Selensky A Study of 0/1 Encodings Prosser & Selensky.

The Stable Marriage Problem and Constraint Programming.

Symmetry Definitions for Constraint Satisfaction Problems Dave Cohen, Peter Jeavons, Chris Jefferson, Karen Petrie and Barbara Smith.

Constraint Satisfaction Problems

1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)

Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.

Optimal Rectangle Packing: A Meta-CSP Approach Chris Reeson Advanced Constraint Processing Fall 2009 By Michael D. Moffitt and Martha E. Pollack, AAAI.

Chapter 6 FUZZY FUNCTION Chi-Yuan Yeh. Kinds of fuzzy function Crisp function with fuzzy constraint Fuzzy extension function which propagates the fuzziness.

A failed attempt to optimize variable ordering with tools for Constraints Solving Edmund ClarkeOfer Strichman Carnegie Mellon University.

1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.

CS774. Markov Random Field : Theory and Application Lecture 20 Kyomin Jung KAIST Nov

Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.

Locally Testable Codes and Expanders Tali Kaufman Joint work with Irit Dinur.

Distributed Message Passing for Large Scale Graphical Models Alexander Schwing Tamir Hazan Marc Pollefeys Raquel Urtasun CVPR2011.

Finding Optimal Refueling Policies Shieu-Hong Lin Biola University.

A Linear Round Lower Bound for Lovasz-Schrijver SDP relaxations of Vertex Cover Grant Schoenebeck Luca Trevisan Madhur Tulsiani UC Berkeley.

Anagh Lal Monday, April 14, Chapter 9 – Tree Decomposition Methods Anagh Lal CSCE Advanced Constraint Processing.

What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.

Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.

Utrecht, february 22, 2002 Applications of Tree Decompositions Stan van Hoesel KE-FdEWB Universiteit Maastricht

Linear Programming – Max Flow – Min Cut Orgad Keller.

What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.

Joanna Ellis-Monaghan, St. Michaels College Paul Gutwin, Principal Technical Account Manager, Cadence.

Table of Contents The independent variable, x, denotes a member of the domain and the dependent variable, y, denotes a member of the range. We say, "y.

Linear Programming independent research project Nick Yates 30 th April 2008.

1 Algebraic Structure in Almost-Symmetries Igor Markov, Univ. of Michigan Presented by Ian Gent, St. Andrews.

4.4 Equations as Relations

Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.

Constraint Satisfaction Basics strongly influenced by Rina Dechter, “Constraint Processing”, 2003.

CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.

CP Summer School Modelling for Constraint Programming Barbara Smith 4. Combining Viewpoints, Modelling Advice.

The countable character of uncountable graphs François Laviolette Barbados 2003.

Explorations in Artificial Intelligence Prof. Carla P. Gomes Module 6 Binary CSP.

Constraint Satisfaction Basics strongly influenced by Dr. Rina Dechter: “Constraint Processing”

1 Constraint Symmetry and Solution Symmetry Presented by Beau M. Christ Symmetry in CSP’s Spring 2010 Presented by Beau M. Christ Symmetry in CSP’s Spring.

Math – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.

CP Summer School Modelling for Constraint Programming Barbara Smith 3. Symmetry, Viewpoints.

Eliminating non- binary constraints Toby Walsh Cork Constraint Computation Center.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Goal: Identify and graph functions..  Relation: mapping or pairing, of input values with output values.  Domain: Set of input values.  Range: set of.

An Introduction to Constraint Programming in JChoco.

Cbj. What’s a csp? a set of variables each with a domain of values a collection of constraints (I’m going to assume binary for the present) assign each.

Copyright © Cengage Learning. All rights reserved.

Proof technique (pigeonhole principle)

The countable character of uncountable graphs François Laviolette Barbados 2003.

Proof Techniques and Chessboard Problems

What is the next line of the proof?

4-6 Formulizing Relations and Functions

The Taxi Scheduling Problem

Computability and Complexity

Identifying functions and using function notation

Linear Systems Chapter 3.

Domain & Range from Graphs

Math3H – Unit 2 Day 3 Linear Programming

Linear Programming Objectives: Set up a Linear Programming Problem

3-4 Linear Programming.

GreedyMaxCut a b w c d e 1.

Architecture Synthesis

Warm Up Given y = –x² – x + 2 and the x-value, find the y-value in each… 1. x = –3, y = ____ 2. x = 0, y = ____ 3. x = 1, y = ____ –4 – −3 2 –

Basics of Functions and Their Graphs

Relations and functions

Nature does nothing uselessly.

3.5 – Introduction to Functions

Linear Programming.

2-1 Relations & Functions

Presentation transcript:

Maximal Independent Sets of a Hypergraph IJCAI01

A hypergraph G = (V,E) V is a set of vertices E is a set of hyperedges an edge with 2 or more vertices An independent set S assume vertices(e) is set of vertices in hyperedge e Maximal independent set S there is no independent set S that subsumes S Whats that then?

Show Me! A Hypergraph

Show Me! An Independent Set You could add vertex 3 or vertex 8! It aint maximal

Show Me! A Maximal Independent Set There are 11 maximal independent sets of size 6

Show Me! The Largest Independent Set There is only one for this graph

Show Me! A Minimal Maximal Independent Set There are 3 minimal maximal independent set Honest!

… and now for a constraint programming solution … in Choco

CP/Choco But what about maximality?

CP/Choco Encoding Maximality That is, we state when a variable MUST be selected and when it MUST NOT be selected An example, vertex 2

CP/Choco Example, vertices 1,2, and 3

More Generally

… heres some code

So?

You can reformulate a csp as a problem of finding a independent set of a hypergraph (this is not new) The independent set has to be of size n It is also maximal

X + Y + Z = 2 where X, Y and Z are in {0,1} An Example We have n.m vertices A hyper edge for each nogood An m-clique for each variables domain Give me an independent set of size n

Another ExampleGolomb Ruler A ruler with N ticks Distance between every pair of ticks is different Ruler is of length L Independent Set encoding N.L vertices, corresponding to the L possible values for each of the N ticks N cliques of size L (binary nogoods) Hyper edges of arity 3

There are maximality problems out there e.g. determining properties of block design problems experiments are proceeding Dont need maximality constraint for csp reformulation but does it help propagation? Experiments required Reformulate a part of the problem, and link via channeling Use maximality as learning? For a csp with n variables, what is a maximal independent set of size less than n? What kind of nogood is this? Do we have one way of dealing with solvable and over- constrained csps Conclusion

Easy questions only