'Integrality gap' presentation slideshows

Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations

Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations. Yuan Zhou Computer Science Department Carnegie Mellon University. Combinatorial Optimization. Goal: optimize an objective function of n 0-1 variables Subject to: certain constraints

673 views • 54 slides

Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations

Understanding the Power of Convex Relaxation Hierarchies: Effectiveness and Limitations. Yuan Zhou Computer Science Department Carnegie Mellon University. Combinatorial Optimization. Goal: optimize an objective function of n 0-1 variables Subject to: certain constraints

542 views • 54 slides

Routing and Treewidth (Recent Developments)

Routing and Treewidth (Recent Developments). Chandra Chekuri Univ. of Illinois, Urbana-Champaign. Routing Problems. Undir graph G=(V,E) and k node-pairs s 1 t 1 , s 2 t 2 , ... , s k t k EDP: can all pairs be connected by edge-disjoint paths?

511 views • 42 slides

SDP Based Approach for Graph Partitioning and Embedding Negative Type Metrics into L 1

CS Perspective. SDP Based Approach for Graph Partitioning and Embedding Negative Type Metrics into L 1. Math Perspective. Parts I & II. Subhash Khot (Georgia Tech) Nisheeth K. Vishnoi (IBM Research and Georgia Tech). S. Sparsest Cut (SC) cut of minimum sparsity. S c.

382 views • 38 slides

419 views • 32 slides

Linear Round Integrality Gaps for the Lasserre Hierarchy

Linear Round Integrality Gaps for the Lasserre Hierarchy. Grant Schoenebeck. Max Cut IP. Given graph G Partition vertices into two sets to Maximize # edges crossing partition. Max Cut IP Homogenized. Max Cut SDP [GW94]. Integral Solution SDP Solution. Integrality Gap = min

358 views • 28 slides

Approximation and Hardness Results for Packing Cycles

Approximation and Hardness Results for Packing Cycles. Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint work with M. Krivelevich (Tel Aviv U.) Z. Nutov (Open U.) J. Verstraete (U. Waterloo) R. Yuster (U. Haifa). Packing problems.

324 views • 23 slides

Aditya Bhaskara ( Princeton ) Moses Charikar (Princeton) Venkatesan Guruswami (CMU)

Polynomial integrality gaps for strong SDP relaxtions of Densest k-Subgraph. Aditya Bhaskara ( Princeton ) Moses Charikar (Princeton) Venkatesan Guruswami (CMU) Aravindan Vijayaraghavan (Princeton) Yuan Zhou (CMU). The Densest k-Subgraph (DkS) problem. Problem description

331 views • 22 slides

Aditya Bhaskara ( Princeton ) Moses Charikar (Princeton) Venkatesan Guruswami (CMU)

Polynomial integrality gaps for strong SDP relaxtions of Densest k-Subgraph. Aditya Bhaskara ( Princeton ) Moses Charikar (Princeton) Venkatesan Guruswami (CMU) Aravindan Vijayaraghavan (Princeton) Yuan Zhou (CMU). The Densest k-Subgraph (DkS) problem. Problem description

230 views • 22 slides

301 views • 20 slides

Primal-dual algorithms for node-weighted network design in planar graphs

Primal-dual algorithms for node-weighted network design in planar graphs. Grigory Yaroslavtsev Penn State (joint work with Piotr Berman). Feedback Vertex Set Problems. Given: a collection of cycles in a graph Goal: break them, removing a small # of vertices.

326 views • 17 slides

Linear Programming (LP)

256 views • 12 slides