Perfect Graphs Lecture 23: Apr 17. Hard Optimization Problems Independent set Clique Colouring Clique cover Hard to approximate within a factor of coding.

Slides:



Advertisements
Similar presentations
The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Advertisements

C&O 355 Lecture 23 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
1 LP Duality Lecture 13: Feb Min-Max Theorems In bipartite graph, Maximum matching = Minimum Vertex Cover In every graph, Maximum Flow = Minimum.
1 Matching Polytope x1 x2 x3 Lecture 12: Feb 22 x1 x2 x3.
Bipartite Matching, Extremal Problems, Matrix Tree Theorem.
Bayesian Networks, Winter Yoav Haimovitch & Ariel Raviv 1.
C&O 355 Mathematical Programming Fall 2010 Lecture 22 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
A Separator Theorem for Graphs with an Excluded Minor and its Applications Paul Seymour Noga Alon Robin Thomas Lecturer : Daniel Motil.
Heuristics for the Hidden Clique Problem Robert Krauthgamer (IBM Almaden) Joint work with Uri Feige (Weizmann)
Approximating Maximum Subgraphs Without Short Cycles Guy Kortsarz Join work with Michael Langberg and Zeev Nutov.
B IPARTITE I NDEX C ODING Arash Saber Tehrani Alexandros G. Dimakis Michael J. Neely Department of Electrical Engineering University of Southern California.
CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Introduction to Approximation Algorithms Lecture 12: Mar 1.
Approximation Algoirthms: Semidefinite Programming Lecture 19: Mar 22.
Totally Unimodular Matrices Lecture 11: Feb 23 Simplex Algorithm Elliposid Algorithm.
Semidefinite Programming
1 Introduction to Linear and Integer Programming Lecture 9: Feb 14.
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.
Vertex Cover, Dominating set, Clique, Independent set
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
Graph Colouring Lecture 20: Nov 25.
Is the following graph Hamiltonian- connected from vertex v? a). Yes b). No c). I have absolutely no idea v.
Theta Function Lecture 24: Apr 18. Error Detection Code Given a noisy channel, and a finite alphabet V, and certain pairs that can be confounded, the.
Matching Polytope, Stable Matching Polytope Lecture 8: Feb 2 x1 x2 x3 x1 x2 x3.
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
Coloring Algorithms and Networks. Coloring2 Graph coloring Vertex coloring: –Function f: V  C, such that for all {v,w}  E: f(v)  f(w) Chromatic number.
(work appeared in SODA 10’) Yuk Hei Chan (Tom)
The Maximum Independent Set Problem Sarah Bleiler DIMACS REU 2005 Advisor: Dr. Vadim Lozin, RUTCOR.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
1 Spanning Tree Polytope x1 x2 x3 Lecture 11: Feb 21.
Outline Introduction The hardness result The approximation algorithm.
Circle Graph and Circular Arc Graph Recognition. 2/41 Outlines Circle Graph Recognition Circular-Arc Graph Recognition.
C&O 355 Mathematical Programming Fall 2010 Lecture 17 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
Distance Approximating Trees in Graphs
C&O 355 Mathematical Programming Fall 2010 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
1 Treewidth, partial k-tree and chordal graphs Delpensum INF 334 Institutt fo informatikk Pinar Heggernes Speaker:
Lecture 22 More NPC problems
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Graph Theory in Networks Lecture 4, 9/9/04 EE 228A, Fall 2004 Rajarshi Gupta University of California, Berkeley.
Approximation Algorithms
Memory Allocation of Multi programming using Permutation Graph By Bhavani Duggineni.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Graph Partitions. Partition V(G) into k sets (k=3)  Vertex partitions.
Twenty Years of EPT Graphs: From Haifa to Rostock Martin Charles Golumbic Caesarea Rothschild Institute University of Haifa With thanks to my research.
Graph Colouring Lecture 20: Nov 25. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including.
CSE 589 Part V One of the symptoms of an approaching nervous breakdown is the belief that one’s work is terribly important. Bertrand Russell.
Computing Branchwidth via Efficient Triangulations and Blocks Authors: F.V. Fomin, F. Mazoit, I. Todinca Presented by: Elif Kolotoglu, ISE, Texas A&M University.
A perfect notion László Lovász Microsoft Research To the memory of Claude Berge.
Interval Graph Test Wen-Lian Hsu.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
C&O 355 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
Approximation Algorithms Greedy Strategies. I hear, I forget. I learn, I remember. I do, I understand! 2 Max and Min  min f is equivalent to max –f.
An introduction to chordal graphs and clique trees
Subgraphs Lecture 4.
Lap Chi Lau we will only use slides 4 to 19
Richard Anderson Lecture 26 NP-Completeness
Topics in Algorithms Lap Chi Lau.
Richard Anderson Lecture 26 NP-Completeness
What is the next line of the proof?
Vertex Cover, Dominating set, Clique, Independent set
Computability and Complexity
ICS 353: Design and Analysis of Algorithms
Approximation Algorithms
Problem Solving 4.
Lecture 28 Approximation of Set Cover
Lecture 24 Vertex Cover and Hamiltonian Cycle
Presentation transcript:

Perfect Graphs Lecture 23: Apr 17

Hard Optimization Problems Independent set Clique Colouring Clique cover Hard to approximate within a factor of coding scheduling

Graph Product Given G1=(V1,E1) and G2=(V2,E2), their product G1xG2 is the graph whose vertex set is V1xV2 and the edge set is {((u1,v1),(u2,v2)) : u1=u2 and (v1,v2) in E2 or v1=v2 and (u1,u2) in E1 or (u1,u2) in E1 and (v1,v2) in E2. Claim: There is a clique of size >= k in G if and only if there is a clique of size >= k 2 in GxG.

Constant Factor Hardness Assuming clique is hard to approximate within a factor of (1+є), then it is also hard to approximate within any constant factor. Idea: take graph product.

Perfect Graph Graphs in which these hard problems are “nice”. Independent set Clique Colouring Clique cover Easy equalities: Easy inequalities:

Perfect Graph In what graphs does the equalitiy holds? A graph is perfect if for every induced subgraph H of G, A graph is co-perfect if for every induced subgraph H of G, What graphs are perfect? Bipartite graphs What graphs are co-perfect? Bipartite graphs What graphs are not perfect? Odd cycles What graphs are not co-perfect? Odd cycles

Line Graph of Bipartite Graph Vertices correspond to edges of a bipartite graph, and two vertices have an edge if and only if the corresponding edges share an endpoint. Line graph of bipartite graphs are perfect. Line graph of bipartite graphs are co-perfect.

Interval Graph Vertices correspond to intervals, and two vertices have an edge if and only if the corresponding intervals overlap. Interval graphs are perfect. Interval graphs are co-perfect. Many applications.

Chordal Graph Also known as triangulated graphs. A graph is chordal if every cycle of length >=4 has a chord. A graph is chordal if it is the intersection graph of subtrees of a tree. A graph is chordal if it has an ordering such that for each vertex the neighbours in front form a clique. Chordal graphs are perfect. Chordal graphs are co-perfect.

Conjectures Perfect graph conjecture: A graph is perfect if and only if it is co-perfect. Strong perfect graph conjecture [Berge 1960]: A graph is perfect if and only if it does not contain odd cycles and the complement of odd cycles as induced subgraphs. Lovasz 1970 Chudnovsky, Robinson, Seymour, Thomas 2003

LP-Perfect In which graphs do the LP always have integral solutions for independent set? This LP is integral only if the input graph is bipartite.

LP-Perfect In which graphs do the LP always have integral solutions for independent set? for each clique C No known polynomial time separation oracle. A graph is LP-perfect if and only if the above linear program is integral.

Perfect Graph Theorem The following are equivalent 1.A graph is perfect. 2.A graph is LP-perfect. 3.A graph is co-perfect.

Duplication Lemma Let G be a graph and v be a vertex. Let G+ be the graph obtained from G by adding a new vertex v’ and connecting it to v and the neighbours of v. Lemma. If G is perfect, then G+ is perfect.

Proof of Duplication Lemma It is enough to prove If v is in a maximum clique, then both sides plus 1. Consider an optimal colouring of G. Let v be coloured red. Consider G-R+v, with maximum clique at most w(G)-1. Colour G-R+v using w(G)-1 colours. So colour G using w(G) colours as R-v+v’ is an independent set.

Perfect => LP-perfect for each clique C Compute an optimal solution of the LP. Let qx be integral. Duplicate each vertex by qx(v) times to obtain a graph G’. G’ is perfect and has clique size exactly q and total cost at most qLP. Decompose G’ into q independent set, one must have cost at most LP.

LP-perfect => co-Perfect for each clique Cfor each vertex v Consider a clique C with positive value in an optimal dual solution. This clique C must intersect every maximum independent set.

co-Perfect => Perfect Take the complement of G and apply perfect => co-perfect!

Strong Perfect Graph Theorem A polynomial time algorithm to recognize perfect graphs.

What’s Next Shannon coding Lovasz Theta function Solve the clique LP using SDP Colouring 3-colourable graphs