'Sparsest cut' presentation slideshows

Spectral Graph Theory (Basics)

Spectral Graph Theory (Basics). Charalampos (Babis) Tsourakakis CMU. Outline. Reminders Adjacency matrix Intuition behind eigenvectors: Bipartite Graphs Walks of length k Case Study: Triangles Laplacian Connected Components Intuition: Adjacency vs. Laplacian

1.06k views • 68 slides

Geometry and Expansion: A survey of some results

603 views • 50 slides

Geometry and Expansion: A survey of some results

507 views • 50 slides

Geometry and Expansion: A survey of recent results

680 views • 45 slides

Geometry and Expansion: A survey of recent results

533 views • 45 slides

Geometry and Expansion: A survey of recent results

601 views • 45 slides

My relationship with correlation clustering started in 2016

My relationship with correlation clustering started in 2016. From June-July 2016 I visited Melbourne as part of the East Asia and Pacific Summer Institute Fellowship. Tony and I studied weighted correlation clustering with low-rank advice

461 views • 45 slides

Cuts, Trees, and Electrical Flows

359 views • 28 slides

Prize Collecting Cuts

Prize Collecting Cuts. Daniel Golovin Carnegie Mellon University Lamps of ALADDIN 2005 Joint work with Mohit Singh & Viswanath Nagarajan. The Problem. Input: Undirected graph G = (V,E), root vertex r, and integer K, 0 < K < |V|

324 views • 27 slides

geometric embeddings and graph expansion

geometric embeddings and graph expansion. James R. Lee. Institute for Advanced Study (Princeton) University of Washington (Seattle). outline. in the talk:. Philosophy of geometric embeddings Example: Finding balanced cuts in graphs Four important open problems. not in the talk:.

362 views • 26 slides

Introduction to Approximation Algorithms

Introduction to Approximation Algorithms. Lecture 12: Mar 1. NP-completeness. We have seen many polynomial time solvable optimization problems. e.g. maximum matching, min-cost flow, minimum cut, etc. .

434 views • 21 slides

On the hardness of approximating Sparsest-Cut and Multicut

On the hardness of approximating Sparsest-Cut and Multicut. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar. Multicut. s 3. s 1. s 2. t 4. s 4. Goal: separate each s i from t i removing the fewest edges. t 2. t 3. t 1. Cost = 7. Sparsest Cut. s 3.

270 views • 18 slides

Planning for Fast Connectivity Updates

259 views • 17 slides

Generalized Sparsest Cut and Embeddings of Negative-Type Metrics

273 views • 16 slides

Integrality Gaps for Sparsest Cut and Minimum Linear Arrangement Problems

Integrality Gaps for Sparsest Cut and Minimum Linear Arrangement Problems. Nikhil R. Devanur Subhash A. Khot Rishi Saket Nisheeth K. Vishnoi. Sparsest Cut Problem (SCP) and b -Balanced Cuts (BSP). Given undirected graph G=(V,E) , find subset of nodes S, |S|<|V|/2 that minimizes

316 views • 15 slides