400 likes | 659 Views
Semidefinite Programming Based Approximation Algorithms. Uri Zwick Tel Aviv University UKCRC’02, Warwick University, May 3, 2002. Outline of talk. Semidefinite programming MAX CUT (Goemans, Williamson ’95 ) MAX 2 -SAT and MAX DI-CUT (FG’95, MM’01, LLZ’02)
E N D
Semidefinite Programming Based Approximation Algorithms Uri ZwickTel Aviv University UKCRC’02, Warwick University, May 3, 2002.
Outline of talk Semidefinite programming MAX CUT (Goemans, Williamson ’95) MAX 2-SAT and MAX DI-CUT (FG’95, MM’01, LLZ’02) MAX 3-SAT (Karloff, Zwick ’97) -function (Lovász ’79) MAX k-CUT (Frieze, Jerrum ’95) Colouring k-colourable graphs (Karger, Motwani, Sudan ’95)
Positive Semidefinite Matrices A symmetric nnmatrix A is PSDiff: • xTAx 0, for every xRn. • A=BTB , for some mnmatrix B. • All the eigenvalues of A are non-negative. Notation: A0iff A is PSD
Semidefinite Programming Linear Programming max CX s.t. AiX bi X 0 max cx s.t. ai x bi x 0 Can be solved exactlyin polynomial time Can be solvedalmost exactlyin polynomial time
LP/SDP algorithms • Simplex method (LP only) • Ellipsoid method • Interior point methods Algorithms work well in practice, not only in theory!
Semidefinite Programming(Equivalent formulation) max cij(vi vj) s.t. aij(k)(vi vj) b(k) viRn X ≥ 0 iff X=BTB. If B = [v1 v2 … vn] then xij = vi ·vj.
Lovász’s -function(one of many formulations) max JX s.t. xij =0 , (i,j)E IX= 1 X 0 Orthogonal representation of a graph: vi vj =0 , whenever (i,j)E
The Sandwich Theorem(Grötschel-Lovász-Schrijver ’81) Size of max clique Chromaticnumber
The MAX CUT problem Edges may be weighted
The MAX CUT problem: motivation Given: n activities, m persons. Each activity can be scheduled either in the morning or in the afternoon. Each person interested in two activities. Task: schedule the activities to maximize the number of persons that can enjoy both activities. If exactly n/2 of the activities have to be held in the morning, we get MAX BISECTION.
The MAX CUT problem: status • Problem is NP-hard • Problem is APX-hard (no PTAS unless P=NP) • Best approximation ratio known, without SDP, is only ½. (Choose a random cut…) • With SDP, an approximation ratio of 0.878 can be obtained! (Goemans-Williamson ’95) • Getting an approximation ratio of 0.942is NP-hard! (PCP theorem, …, Håstad’97)
An SDP Relaxation of MAX CUT – Geometric intuition Embed the vertices of the graph on the unit spheresuch that vertices that are joined by edges are far apart.
r To choose a random hyperplane,choose a random normal vector Ifr = (r1 , r2 , …, rn),andr1, r2 , … , rn N(0,1),thenthe direction of ris uniformly distributed over the n-dimensional unit sphere.
The probability that two vectors are separated by a random hyperplane vi vj
Is the analysis tight? Yes! (Karloff ’96) (Feige-Schechtman ’00)
The MAX Directed-CUT problem Edges may be weighted
Triangle constraints A Semidefinite Programming Relaxation of MAX 2-SAT(Feige-Lovász ’92, Feige-Goemans ’95)
Skewed hyperplanes(Feige-Goemans ’95, Matuura-Matsui ’01) Choose a random vector rthat isskewed toward v0. Without loss of generality v0 = (1,0, …,0). Let r = (r1 , r2 ,…, rn), where r2 ,…, rn ~ N(0,1).Choose r1 according to a different distribution.
“Threshold” rounding(Lewin-Livnat-Zwick ’02) Choose a random vector rperpendicular to v0. Set xi=1 iff vi ·r≥ T(v0·vi).
The MAX 3-SAT problem(Karloff-Zwick ’97 Zwick ’02) A performance ratio of 7/8 is obtained using: • A more complicated SDP relaxation • The simple random hyperplane rounding. • A much more complicated analysis. • Computer assisted proof. (Z’02)
What else can we do with SDPs? • MAX BISECTION (Frieze-Jerrum ’95) • MAX k-CUT(Frieze-Jerrum ’95) • (Approximate) Graph colouring(Karger-Motwani-Sudan’95)
(Approximate) Graph colouring • Given a 3-colourable graph, colour it, in polynomial time, using as few colours as possible. • Colouring using 4 colours is still NP-hard. (Khanna-Linial-Safra’93 Khanna-Guruswami’01) • A simple combinatorial algorithm can colour, in polynomial time, using about n1/2 colours.(Wigderson’81) • Using SDP, can colour (in poly. time) using n1/4 colours (KMS’95), or even n3/14 colours (BK’97).
Vector k-Coloring(Karger-Motwani-Sudan ’95) A vector k-coloring of a graph G = (V,E) is a sequence of unit vectors v1 , v2 , … , vn such that if (i,j)E then vi ·vj = -1/(k-1). The minimum k for which G is vector k-colorable is A vector k-coloring, if one exists, can be found using SDP.
Lemma: If G = (V,E)is k-colorable, then it is also vectork-colorable. Proof: There are k vectors v1 ,v2 , … , vk such that vi ·vj = -1/(k-1), for i ≠ j. k = 3 :
Finding large independent sets(Karger-Motwani-Sudan ’95) Let r be a random normally distributed vector inRn. Let . I’ is obtained from I by removing a vertex from each edge ofI.
Colouring k-colourable graphs Colouring k-colourable graphs using min{ Δ1-2/k,n1-3/(k+1) } colours.(Karger-Motwani-Sudan ’95) Colouring 3-colourable graphs using n3/14 colours. (Blum-Karger ’97) Colouring 4-colourable graphs using n7/19 colours. (Halperin-Nathaniel-Zwick ’01)
Open problems Improved results for the problems considered. Further applications of SDP.