Cuts & Metrics: Multiway Cut
|
|
- Cassandra Day
- 5 years ago
- Views:
Transcription
1 Cuts & Metrics: Multiway Cut Barna Saha April 21, 2015
2 Cuts and Metrics Multiway Cut Probabilistic Approximation of Metrics by Tree Metric
3 Cuts & Metrics Metric Space: A metric (V, d) on a set of vertices V gives a distance d uv for each pair of vertices u, v V such that the following properties are obeyed. d u,v = 0 iff v = u (semimetric does not respect this property though d(u, u) = 0 always) d u,v = d v,u u, v V d u,v d u,w + d w,v u, v, w V May some time ignore the distinction of semimetric and metric Metrics are useful way of thinking about graph problems involving cuts.
4 Cut Semimetric For any cut S V, define d u,v = 1 if u S and v / S, else d(u, v) = 0 If we are trying to find a s-t cut which minimizes total weight of edges crossing the cut, we can write: min w e d u,v subject to d s,t = 1 e=(u,v) E d u,v d u,w + d w,v u, v, w V d u,v = {0, 1} u, v E
5 Cut Semimetric For any cut S V, define d u,v = 1 if u S and v / S, else d(u, v) = 0 If we are trying to find a s-t cut which minimizes total weight of edges crossing the cut, we can write: min w e d u,v subject to d s,t = 1 e=(u,v) E d u,v d u,w + d w,v u, v, w V d u,v [0, 1] u, v E (Metric Relaxation) We can solve s-t mincut via Metric Relaxation.
6 Multiway Cut Problem Given an undirected graph G = (V, E), costs c e 0 for all edges e E and k distinguished vertices s 1, s 2,..., s k, remove a minimum-cost collection of edges such that every pair of distinguished vertices s i, s j, i j, get separated.
7 Multiway Cut Problem Given an undirected graph G = (V, E), costs c e 0 for all edges e E and k distinguished vertices s 1, s 2,..., s k, remove a minimum-cost collection of edges such that every pair of distinguished vertices s i, s j, i j, get separated. Applications Many! Look for them.
8 Multiway Cut Isola(ng cut for s1 s3 Can compute isola(ng cut op(mally
9 Multiway Cut Isola(ng cut for s2 Isola(ng cut for s1 Isola(ng cut for s3 s3 Return union of the isola(ng cuts A 2-approximation.
10 3 2-approximation for Multiway Cut Problem Partition the set of vertices into C 1, C 2,..., C k such that s i C i, for i = 1, 2,.., k, to minimize the edges crossing them. Formulate it in terms of integer linear program. Obtain a linear programming relaxation. Round (Randomized Rounding) it utilizing connection to metrics.
11 3 2-approximation for Multiway Cut Problem k different variables x i u for a vertex u, x i u = 1 if u C i. k different variables z i e for an edge e, z i e = 1 if e δ(c i ) Each edge in exactly two C i, C j. Hence the objective is Constraints: min 1 2 xs i i = 1, i = 1, 2,.., k k xu i = 1, u V i=1 k c e ze i e E i=1 For all edge e = (u, v) z i e x i u x i v x i u = {0, 1}, z i e = {0, 1} i, u V, e E
12 3 2-approximation for Multiway Cut Problem k different variables x i u for a vertex u, x i u = 1 if u C i. k different variables z i e for an edge e, z i e = 1 if e δ(c i ) Each edge in exactly two C i, C j. Hence the objective is Constraints: min 1 2 xs i i = 1, i = 1, 2,.., k k xu i = 1, u V i=1 k c e ze i e E i=1 For all edge e = (u, v) z i e = x i u x i v x i u = {0, 1}, z i e = {0, 1} i, u V, e E
13 3 2-approximation for Multiway Cut Problem k different variables x i u for a vertex u, x i u = 1 if u C i. k different variables z i e for an edge e, z i e = 1 if e δ(c i ) Each edge in exactly two C i, C j. Hence the objective is Constraints: min 1 2 c e e=(u,v) E i=1 k xu i xv i xs i i = 1, i = 1, 2,.., k k xu i = 1, u V i=1 x i u = {0, 1}, i, u V
14 3 2-approximation for Multiway Cut Problem k different variables x i u for a vertex u, x i u = 1 if u C i. k different variables z i e for an edge e, z i e = 1 if e δ(c i ) Each edge in exactly two C i, C j. Hence the objective is Constraints: min 1 2 e=(u,v) E c e x u x v l1 xs i i = 1, i = 1, 2,.., k k xu i = 1, u V i=1 x i u = {0, 1}, i, u V
15 3 2-approximation for Multiway Cut Problem k different variables x i u for a vertex u, x i u = 1 if u C i. k different variables z i e for an edge e, z i e = 1 if e δ(c i ) Each edge in exactly two C i, C j. Hence the objective is Constraints: min 1 2 e=(u,v) E xs i i = 1, i = 1, 2,.., k k xu i = 1, u V i=1 c e x u x v l1 x i u [0, 1] i, u V (Relaxation)
16 3 2-approximation for Multiway Cut Problem k different variables x i u for a vertex u, x i u = 1 if u C i. k different variables z i e for an edge e, z i e = 1 if e δ(c i ) Each edge in exactly two C i, C j. Hence the objective is Constraints: min 1 2 e=(u,v) E c e x u x v l1 x si = e i, i = 1, 2,.., k x u k u V (Relaxation) Find location of U {s 1, s 2,.., s k } points in k-dimensional simplex such that their all-pair weighted sum of l 1 -distances is minimized
17 3 2-approximation for Multiway Cut Problem Intuition. Gives location to points in simplex. If a point is closest to e i assign it to C i Use randomization to define close so that each edge (u, v) is cut with probability 3 4 x u x v l1
18 3 2-approximation for Multiway Cut Problem For any r 0, define B(e i, r) = {u V : 1 2 e i x u l1 r} All vertices are within radius 1.
19 3 2-approximation for Multiway Cut Problem Algorithm. Let x be an optimum LP solution for all 1 i k do C i φ Pick r (0, 1) uniformly at random Pick a random permutation π of {1, 2,..., k} X φ // X keeps track of vertices already assigned for i = 1 to k 1 do C π(i) B(s π(i), r) X X X C π(i) C π(k) V X return F = k i=1 δ(c i)
20 3 2-approximation for Multiway Cut Problem Analysis Lemma x l u x l v 1 2 x u x v l1 Lemma u B(s i, r) if and only if 1 x i u r. Show that Prob((u, v)is cut) 3 4 x u x v l1.
21 3 2-approximation for Multiway Cut Problem Analysis Show that Prob((u, v) is cut) 3 4 x u x v l1. Define events S i : i is the first in the permutation s.t. one of u or v is in B(e i, r) X i : exactly one of u or v belongs to B(e i, r) For e to be cut, there must exists at least one i such that both S i and X i happens. Compute k Prob(S i X i ) i=1
22 3 2-approximation for Multiway Cut Problem Prob(X i ) = Prob(min (1 x i u, 1 x i v ) r max (1 x i u, 1 x i v )) = x i u x i v 1 2 x u x v l1 Let l be the vertex which minimizes min i min(1 x i u, 1 x i v ). If i l and l comes before i in π then S i is false. Prob(S i X i ) = Prob(S i X i π(l) < π(i))prob(π(l) < π(i)) + Prob(S i X i π(l) > π(i))prob(π(l) > π(i)) = Prob(S i X i π(l) > π(i))prob(π(l) > π(i)) = Prob(S i X i π(l) > π(i)) 1 2 Prob(X i π(l) > π(i)) 1 2 = Prob(X i) 1 2 = 1 2 x i u x i v
23 3 2-approximation for Multiway Cut Problem Prob(S i X i ) = Prob(X i ) 1 2 = 1 2 x i u x i v Prob(S i X i ) = 1 2 x u i xv i + Prob(S l X l ) i i,i l 1 2 ( x u x v ( x l u x l v )) + x l u x l v = 1 2 ( x u x v + x l u x l v ) x u x v = 3 4 x u x v
24 Probabilistic Approximation of Metrics by Tree Metric Use tree metrics to approximate a given distance metric d on a set of vertices V A tree metric (V, T ) for a set of vertices V is a tree T on V V with nonnegative edge lengths. Distance T u,v is the unique shortest path length from u to v. We want for some small α 1 the following to hold for all vertices u, v V α: distortion of embedding. d(u, v) T (u, v) αd(u, v)
25 Importance of Low Distortion Embedding Many problems are easy to solve on trees. Use low distortion embedding to reduce problem on general metric space to tree metric. α dictates the approximation factor. See section 8.6 of Shmoys-Williamsons for examples.
26 Tree Embedding Theorem We Want to Prove Unfortunately no deterministic embedding can have distortion o(n). Embed into a distribution of trees. Show expected distortion is low. Theorem Given a distance metric (V, d), such that d(u, v) 1 for all u v, u, v V, there is a randomized, polynomial-time algorithm that produces a tree metric (V, T ), V V, such that for all u, v V, d(u, v) T (u, v) and E[T (u, v)] O(log n)d(u, v).
27 Hierarchical Cut Decomposition Let = 2 k such that 2 k 2 max u,v {d(u, v)} > 2 k 1. Level= log 2 (Δ) < Δ All ver7ces V Δ Δ Δ Level=log 2 (Δ)- 1 < Δ/2 < Δ/2 < Δ/2 log 2 (Δ)- 2 Δ/2 Δ/2 Δ/2 < Δ/4 < Δ/4 < Δ/4 2 i+1 2 i- 1 <=r< 2 i Level=i Level=1 < 2 2 i 2 i 2 i Level= < 1 individual ver7ces v
28 Hierarchical Cut Decomposition Lemma For all pairs of vertices u, v V, d(u, v) T (u, v). Proof. Let d(u, v) = 2 k + r, 2 k < r < 0. u and v cannot appear together in any set at level k 1 or lower. Hence the lowest level in which u and v may appear together is k. The total distance is 2 k i=1 2i = 4( k 1 ) 2 k+2 4 d(u, v). If d(u, v) = 2 k, then the lowest level in which u and v may appear together is k 1, k 2. The total distance is 2 k 1 i=1 2i = 4( k 2 ) 2 k+1 4 d(u, v).
29 Hierarchical Cut Decomposition Lemma If the least common ancestor of vertices u, v V is at level i then T (u, v) 2 i+2.
30 Hierarchical Cut Decomposition Pick a random permutation π of V Set to the smallest power of 2 greater than 2max u,v d(u, v) Pick r 0 [ 1 2, 1) uniformly at random; set r i = 2 i r 0 for all 1 i log 2 // C(i) will be the sets corresponding to the nodes at level i, it creates a partition of V. C(log 2 ) = {V }: create tree node corresponding to V.
31 Hierarchical Cut Decomposition for i log 2 downto 1 do C(i 1) φ for all C C(i) do S C for j 1 to n do if B(π(j), r i 1 ) S φ then Add B(π(j), r i 1 ) S to C(i 1) Remove B(π(j), r i 1 ) S from S Create tree nodes corresponding to all sets in C(i 1), join them to C with edges of length 2 i
32 Hierarchical Cut Decomposition Look at level i and a pair of vertices u, v S iw : In the ith level w is the first vertex such that at least one of u and v is contained in its ball. X iw : In the ith level exactly one of u and v is contained in the ball of w T (u, v) max 1( w V : X i,w S i,w ).2 i+3 i=0,...,log 1 w V E[T (u, v)] w V log 1 i=0 1(X i,w S i,w ).2 i+3 log 1 i=0 Prob(X i,w S i,w ).2 i+3
33 Hierarchical Cut Decomposition E[T (u, v)] w V = w V log 1 i=0 w V log 1 i=0 Prob(X i,w S i,w ).2 i+3 Prob(S i,w X i,w )Prob(X i,w )2 i+3 log 1 b w Prob(X i,w )2 i+3 i=0
34 Hierarchical Cut Decomposition Show log i=1 Prob(X iw).2 i+3 16d u,v. Show if w is the jth closest vertex according to min (d(u, w), d(v, w)) then Prob(S i,w X i,w ) 1 j Set b w = 1 j.
16.1 Min-Cut as an LP
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: LPs as Metrics: Min Cut and Multiway Cut Date: 4//5 Scribe: Gabriel Kaptchuk 6. Min-Cut as an LP We recall the basic definition
More informationPartitioning Metric Spaces
Partitioning Metric Spaces Computational and Metric Geometry Instructor: Yury Makarychev 1 Multiway Cut Problem 1.1 Preliminaries Definition 1.1. We are given a graph G = (V, E) and a set of terminals
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationAn Improved Approximation Algorithm for Requirement Cut
An Improved Approximation Algorithm for Requirement Cut Anupam Gupta Viswanath Nagarajan R. Ravi Abstract This note presents improved approximation guarantees for the requirement cut problem: given an
More informationMetric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces. f injective mapping from M 1 to M 2. M 2 dominates M 1 under f if d M1 (u; v) d M
Approximating a nite metric by a small number of tree metrics Moses Charikar Chandra Chekuri Ashish Goel Sudipto Guha Serge Plotkin Metric Approximations (Embeddings) M M 1 2 f M 1, M 2 metric spaces.
More information15-854: Approximation Algorithms Lecturer: Anupam Gupta Topic: Approximating Metrics by Tree Metrics Date: 10/19/2005 Scribe: Roy Liu
15-854: Approximation Algorithms Lecturer: Anupam Gupta Topic: Approximating Metrics by Tree Metrics Date: 10/19/2005 Scribe: Roy Liu 121 Introduction In this lecture, we show how to embed metric weighted
More informationInteger Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
More informationApproximation slides 1. Cut problems. The character flaw of of Michael Myers, Freddy Kruger and Jason Voorhees: Cut problems
Approximation slides 1 Cut problems The character flaw of of Michael Myers, Freddy Kruger and Jason Voorhees: Cut problems Approximation slides 2 The directed multicut problem S j T j S 1 Figure 1: The
More information25 Minimum bandwidth: Approximation via volume respecting embeddings
25 Minimum bandwidth: Approximation via volume respecting embeddings We continue the study of Volume respecting embeddings. In the last lecture, we motivated the use of volume respecting embeddings by
More informationarxiv:cs/ v1 [cs.cc] 7 Sep 2006
Approximation Algorithms for the Bipartite Multi-cut problem arxiv:cs/0609031v1 [cs.cc] 7 Sep 2006 Sreyash Kenkre Sundar Vishwanathan Department Of Computer Science & Engineering, IIT Bombay, Powai-00076,
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationACO Comprehensive Exam 19 March Graph Theory
1. Graph Theory Let G be a connected simple graph that is not a cycle and is not complete. Prove that there exist distinct non-adjacent vertices u, v V (G) such that the graph obtained from G by deleting
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationScheduling and Optimization Course (MPRI)
MPRI Scheduling and optimization: lecture p. /6 Scheduling and Optimization Course (MPRI) Leo Liberti LIX, École Polytechnique, France MPRI Scheduling and optimization: lecture p. /6 Teachers Christoph
More informationProbability & Computing
Probability & Computing Stochastic Process time t {X t t 2 T } state space Ω X t 2 state x 2 discrete time: T is countable T = {0,, 2,...} discrete space: Ω is finite or countably infinite X 0,X,X 2,...
More informationApproximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs Haim Kaplan Tel-Aviv University, Israel haimk@post.tau.ac.il Nira Shafrir Tel-Aviv University, Israel shafrirn@post.tau.ac.il
More informationTopics in Theoretical Computer Science April 08, Lecture 8
Topics in Theoretical Computer Science April 08, 204 Lecture 8 Lecturer: Ola Svensson Scribes: David Leydier and Samuel Grütter Introduction In this lecture we will introduce Linear Programming. It was
More informationThe min cost flow problem Course notes for Search and Optimization Spring 2004
The min cost flow problem Course notes for Search and Optimization Spring 2004 Peter Bro Miltersen February 20, 2004 Version 1.3 1 Definition of the min cost flow problem We shall consider a generalization
More informationThe min cost flow problem Course notes for Optimization Spring 2007
The min cost flow problem Course notes for Optimization Spring 2007 Peter Bro Miltersen February 7, 2007 Version 3.0 1 Definition of the min cost flow problem We shall consider a generalization of the
More informationBreadth-First Search of Graphs
Breadth-First Search of Graphs Analysis of Algorithms Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Applications of Breadth-First Search of Graphs a) Single Source
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 P and NP P: The family of problems that can be solved quickly in polynomial time.
More informationDistributed Distance-Bounded Network Design Through Distributed Convex Programming
Distributed Distance-Bounded Network Design Through Distributed Convex Programming OPODIS 2017 Michael Dinitz, Yasamin Nazari Johns Hopkins University December 18, 2017 Distance Bounded Network Design
More informationSmall distortion and volume preserving embedding for Planar and Euclidian metrics Satish Rao
Small distortion and volume preserving embedding for Planar and Euclidian metrics Satish Rao presented by Fjóla Rún Björnsdóttir CSE 254 - Metric Embeddings Winter 2007 CSE 254 - Metric Embeddings - Winter
More informationMetrics: Growth, dimension, expansion
Metrics: Growth, dimension, expansion Social and Technological Networks Rik Sarkar University of Edinburgh, 2017. Metric A distance measure d is a metric if: d(u,v) 0 d(u,v) = 0 iff u=v d(u,v) = d(u,v)
More informationarxiv: v1 [cs.ds] 20 Nov 2016
Algorithmic and Hardness Results for the Hub Labeling Problem Haris Angelidakis 1, Yury Makarychev 1 and Vsevolod Oparin 2 1 Toyota Technological Institute at Chicago 2 Saint Petersburg Academic University
More informationApproximation Algorithms for Min-Sum k-clustering and Balanced k-median
Approximation Algorithms for Min-Sum k-clustering and Balanced k-median Babak Behsaz Zachary Friggstad Mohammad R. Salavatipour Rohit Sivakumar Department of Computing Science University of Alberta Edmonton,
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming
princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Matt Weinberg Scribe: Sanjeev Arora One of the running themes in this course is
More informationNotes on MapReduce Algorithms
Notes on MapReduce Algorithms Barna Saha 1 Finding Minimum Spanning Tree of a Dense Graph in MapReduce We are given a graph G = (V, E) on V = N vertices and E = m N 1+c edges for some constant c > 0. Our
More informationDuality of LPs and Applications
Lecture 6 Duality of LPs and Applications Last lecture we introduced duality of linear programs. We saw how to form duals, and proved both the weak and strong duality theorems. In this lecture we will
More informationFINAL EXAM PRACTICE PROBLEMS CMSC 451 (Spring 2016)
FINAL EXAM PRACTICE PROBLEMS CMSC 451 (Spring 2016) The final exam will be on Thursday, May 12, from 8:00 10:00 am, at our regular class location (CSI 2117). It will be closed-book and closed-notes, except
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationTopics in Approximation Algorithms Solution for Homework 3
Topics in Approximation Algorithms Solution for Homework 3 Problem 1 We show that any solution {U t } can be modified to satisfy U τ L τ as follows. Suppose U τ L τ, so there is a vertex v U τ but v L
More informationA Randomized Rounding Approach to the Traveling Salesman Problem
A Randomized Rounding Approach to the Traveling Salesman Problem Shayan Oveis Gharan Amin Saberi. Mohit Singh. Abstract For some positive constant ɛ 0, we give a ( 3 2 ɛ 0)-approximation algorithm for
More informationOn the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces
On the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces Dona-Maria Ivanova under the direction of Mr. Zhenkun Li Department of Mathematics Massachusetts Institute of Technology
More informationBBM402-Lecture 20: LP Duality
BBM402-Lecture 20: LP Duality Lecturer: Lale Özkahya Resources for the presentation: https://courses.engr.illinois.edu/cs473/fa2016/lectures.html An easy LP? which is compact form for max cx subject to
More informationClasses of Problems. CS 461, Lecture 23. NP-Hard. Today s Outline. We can characterize many problems into three classes:
Classes of Problems We can characterize many problems into three classes: CS 461, Lecture 23 Jared Saia University of New Mexico P is the set of yes/no problems that can be solved in polynomial time. Intuitively
More informationCMPUT 675: Approximation Algorithms Fall 2014
CMPUT 675: Approximation Algorithms Fall 204 Lecture 25 (Nov 3 & 5): Group Steiner Tree Lecturer: Zachary Friggstad Scribe: Zachary Friggstad 25. Group Steiner Tree In this problem, we are given a graph
More informationDominating Set. Chapter 26
Chapter 26 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationDominating Set. Chapter Sequential Greedy Algorithm 294 CHAPTER 26. DOMINATING SET
294 CHAPTER 26. DOMINATING SET 26.1 Sequential Greedy Algorithm Chapter 26 Dominating Set Intuitively, to end up with a small dominating set S, nodes in S need to cover as many neighbors as possible. It
More informationfrom notes written mostly by Dr. Matt Stallmann: All Rights Reserved
CSC 505, Fall 000: Week 0 Objectives: understand problem complexity and classes defined by it understand relationships among decision, witness, evaluation, and optimization problems understand what it
More informationDiscrete Optimization 2010 Lecture 2 Matroids & Shortest Paths
Matroids Shortest Paths Discrete Optimization 2010 Lecture 2 Matroids & Shortest Paths Marc Uetz University of Twente m.uetz@utwente.nl Lecture 2: sheet 1 / 25 Marc Uetz Discrete Optimization Matroids
More information1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
More informationLecture 4. 1 Estimating the number of connected components and minimum spanning tree
CS 59000 CTT Current Topics in Theoretical CS Aug 30, 2012 Lecturer: Elena Grigorescu Lecture 4 Scribe: Pinar Yanardag Delul 1 Estimating the number of connected components and minimum spanning tree In
More informationEmbeddings of finite metric spaces in Euclidean space: a probabilistic view
Embeddings of finite metric spaces in Euclidean space: a probabilistic view Yuval Peres May 11, 2006 Talk based on work joint with: Assaf Naor, Oded Schramm and Scott Sheffield Definition: An invertible
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationThe Steiner k-cut Problem
The Steiner k-cut Problem Chandra Chekuri Sudipto Guha Joseph (Seffi) Naor September 23, 2005 Abstract We consider the Steiner k-cut problem which generalizes both the k-cut problem and the multiway cut
More informationDominating Set. Chapter 7
Chapter 7 Dominating Set In this chapter we present another randomized algorithm that demonstrates the power of randomization to break symmetries. We study the problem of finding a small dominating set
More informationLecture 10. Semidefinite Programs and the Max-Cut Problem Max Cut
Lecture 10 Semidefinite Programs and the Max-Cut Problem In this class we will finally introduce the content from the second half of the course title, Semidefinite Programs We will first motivate the discussion
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY
Approximation Algorithms Seminar 1 Set Cover, Steiner Tree and TSP Siert Wieringa siert.wieringa@tkk.fi Approximation Algorithms Seminar 1 1/27 Contents Approximation algorithms for: Set Cover Steiner
More informationLecture 18: March 15
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 18: March 15 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may
More informationApproximation Algorithms
Approximation Algorithms Chapter 26 Semidefinite Programming Zacharias Pitouras 1 Introduction LP place a good lower bound on OPT for NP-hard problems Are there other ways of doing this? Vector programs
More informationLecture Semidefinite Programming and Graph Partitioning
Approximation Algorithms and Hardness of Approximation April 16, 013 Lecture 14 Lecturer: Alantha Newman Scribes: Marwa El Halabi 1 Semidefinite Programming and Graph Partitioning In previous lectures,
More informationThe Steiner Network Problem
The Steiner Network Problem Pekka Orponen T-79.7001 Postgraduate Course on Theoretical Computer Science 7.4.2008 Outline 1. The Steiner Network Problem Linear programming formulation LP relaxation 2. The
More informationChapter 7 Network Flow Problems, I
Chapter 7 Network Flow Problems, I Network flow problems are the most frequently solved linear programming problems. They include as special cases, the assignment, transportation, maximum flow, and shortest
More informationNP Completeness and Approximation Algorithms
Chapter 10 NP Completeness and Approximation Algorithms Let C() be a class of problems defined by some property. We are interested in characterizing the hardest problems in the class, so that if we can
More informationA Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits Ran Raz Amir Shpilka Amir Yehudayoff Abstract We construct an explicit polynomial f(x 1,..., x n ), with coefficients in {0,
More informationNP-problems continued
NP-problems continued Page 1 Since SAT and INDEPENDENT SET can be reduced to each other we might think that there would be some similarities between the two problems. In fact, there is one such similarity.
More informationApproximate Voronoi Diagrams
CS468, Mon. Oct. 30 th, 2006 Approximate Voronoi Diagrams Presentation by Maks Ovsjanikov S. Har-Peled s notes, Chapters 6 and 7 1-1 Outline Preliminaries Problem Statement ANN using PLEB } Bounds and
More informationMinmax Tree Cover in the Euclidean Space
Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 15, no. 3, pp. 345 371 (2011) Minmax Tree Cover in the Euclidean Space Seigo Karakawa 1 Ehab Morsy 1 Hiroshi Nagamochi 1 1 Department
More informationToday: NP-Completeness (con t.)
Today: NP-Completeness (con t.) COSC 581, Algorithms April 22, 2014 Many of these slides are adapted from several online sources Reading Assignments Today s class: Chapter 34.5 (con t.) Recall: Proving
More informationApproximation Algorithms
Approximation Algorithms What do you do when a problem is NP-complete? or, when the polynomial time solution is impractically slow? assume input is random, do expected performance. Eg, Hamiltonian path
More informationA simple LP relaxation for the Asymmetric Traveling Salesman Problem
A simple LP relaxation for the Asymmetric Traveling Salesman Problem Thành Nguyen Cornell University, Center for Applies Mathematics 657 Rhodes Hall, Ithaca, NY, 14853,USA thanh@cs.cornell.edu Abstract.
More informationAdvanced Combinatorial Optimization Feb 13 and 25, Lectures 4 and 6
18.438 Advanced Combinatorial Optimization Feb 13 and 25, 2014 Lectures 4 and 6 Lecturer: Michel X. Goemans Scribe: Zhenyu Liao and Michel X. Goemans Today, we will use an algebraic approach to solve the
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationDominating Set Counting in Graph Classes
Dominating Set Counting in Graph Classes Shuji Kijima 1, Yoshio Okamoto 2, and Takeaki Uno 3 1 Graduate School of Information Science and Electrical Engineering, Kyushu University, Japan kijima@inf.kyushu-u.ac.jp
More informationCS 4407 Algorithms Lecture: Shortest Path Algorithms
CS 440 Algorithms Lecture: Shortest Path Algorithms Prof. Gregory Provan Department of Computer Science University College Cork 1 Outline Shortest Path Problem General Lemmas and Theorems. Algorithms Bellman-Ford
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationA New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality By Markus Bläser
A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality By Markus Bläser Presented By: Chris Standish chriss@cs.tamu.edu 23 November 2005 1 Outline Problem Definition Frieze s Generic
More informationThe Knapsack Problem. 28. April /44
The Knapsack Problem 20 10 15 20 W n items with weight w i N and profit p i N Choose a subset x of items Capacity constraint i x w i W wlog assume i w i > W, i : w i < W Maximize profit i x p i 28. April
More informationLecture: Expanders, in theory and in practice (2 of 2)
Stat260/CS294: Spectral Graph Methods Lecture 9-02/19/2015 Lecture: Expanders, in theory and in practice (2 of 2) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationAlgorithms and Theory of Computation. Lecture 22: NP-Completeness (2)
Algorithms and Theory of Computation Lecture 22: NP-Completeness (2) Xiaohui Bei MAS 714 November 8, 2018 Nanyang Technological University MAS 714 November 8, 2018 1 / 20 Set Cover Set Cover Input: a set
More informationACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge
More informationLinear Programming. Scheduling problems
Linear Programming Scheduling problems Linear programming (LP) ( )., 1, for 0 min 1 1 1 1 1 11 1 1 n i x b x a x a b x a x a x c x c x z i m n mn m n n n n! = + + + + + + = Extreme points x ={x 1,,x n
More informationK-center Hardness and Max-Coverage (Greedy)
IOE 691: Approximation Algorithms Date: 01/11/2017 Lecture Notes: -center Hardness and Max-Coverage (Greedy) Instructor: Viswanath Nagarajan Scribe: Sentao Miao 1 Overview In this lecture, we will talk
More informationCapacitated Metric Labeling
Capacitated Metric Labeling Matthew Andrews Mohammad Taghi Hajiaghayi Howard Karloff Ankur Moitra Abstract We introduce Capacitated Metric Labeling. As in Metric Labeling, we are given a weighted graph
More informationHierarchical Clustering via Spreading Metrics
Journal of Machine Learning Research 18 2017) 1-35 Submitted 2/17; Revised 5/17; Published 8/17 Hierarchical Clustering via Spreading Metrics Aurko Roy College of Computing Georgia Institute of Technology
More informationFixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems
Fixed Parameter Algorithms for Interval Vertex Deletion and Interval Completion Problems Arash Rafiey Department of Informatics, University of Bergen, Norway arash.rafiey@ii.uib.no Abstract We consider
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationAlgorithms for 2-Route Cut Problems
Algorithms for 2-Route Cut Problems Chandra Chekuri 1 and Sanjeev Khanna 2 1 Dept. of Computer Science, University of Illinois, Urbana, IL 61801. chekuri@cs.uiuc.edu 2 Dept. of CIS, Univ. of Pennsylvania,
More informationRandomized Algorithms III Min Cut
Chapter 11 Randomized Algorithms III Min Cut CS 57: Algorithms, Fall 01 October 1, 01 11.1 Min Cut 11.1.1 Problem Definition 11. Min cut 11..0.1 Min cut G = V, E): undirected graph, n vertices, m edges.
More informationORIE 6334 Spectral Graph Theory November 22, Lecture 25
ORIE 64 Spectral Graph Theory November 22, 206 Lecture 25 Lecturer: David P. Williamson Scribe: Pu Yang In the remaining three lectures, we will cover a prominent result by Arora, Rao, and Vazirani for
More informationSolutions to Exercises
1/13 Solutions to Exercises The exercises referred to as WS 1.1(a), and so forth, are from the course book: Williamson and Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011,
More information3.3 Easy ILP problems and totally unimodular matrices
3.3 Easy ILP problems and totally unimodular matrices Consider a generic ILP problem expressed in standard form where A Z m n with n m, and b Z m. min{c t x : Ax = b, x Z n +} (1) P(b) = {x R n : Ax =
More informationPartial cubes: structures, characterizations, and constructions
Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes
More informationLecture 10: Bourgain s Theorem
princeton u. sp 0 cos 598B: algorithms and complexity Lecture 10: Bourgain s Theorem Lecturer: Sanjeev Arora Scribe:Daniel J. Peng The goal of this week s lecture is to prove the l version of Bourgain
More informationCombinatorial Optimization
Combinatorial Optimization 2017-2018 1 Maximum matching on bipartite graphs Given a graph G = (V, E), find a maximum cardinal matching. 1.1 Direct algorithms Theorem 1.1 (Petersen, 1891) A matching M is
More informationLecture 18: More NP-Complete Problems
6.045 Lecture 18: More NP-Complete Problems 1 The Clique Problem a d f c b e g Given a graph G and positive k, does G contain a complete subgraph on k nodes? CLIQUE = { (G,k) G is an undirected graph with
More informationGeometric Steiner Trees
Geometric Steiner Trees From the book: Optimal Interconnection Trees in the Plane By Marcus Brazil and Martin Zachariasen Part 3: Computational Complexity and the Steiner Tree Problem Marcus Brazil 2015
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationCSC 5170: Theory of Computational Complexity Lecture 13 The Chinese University of Hong Kong 19 April 2010
CSC 5170: Theory of Computational Complexity Lecture 13 The Chinese University of Hong Kong 19 April 2010 Recall the definition of probabilistically checkable proofs (PCP) from last time. We say L has
More informationCutting Plane Methods II
6.859/5.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Plane Methods II Gomory-Chvátal cuts Reminder P = {x R n : Ax b} with A Z m n, b Z m. For λ [0, ) m such that λ A Z n, (λ
More informationHomework Assignment 4 Solutions
MTAT.03.86: Advanced Methods in Algorithms Homework Assignment 4 Solutions University of Tartu 1 Probabilistic algorithm Let S = {x 1, x,, x n } be a set of binary variables of size n 1, x i {0, 1}. Consider
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationAlgorithms and Theory of Computation. Lecture 11: Network Flow
Algorithms and Theory of Computation Lecture 11: Network Flow Xiaohui Bei MAS 714 September 18, 2018 Nanyang Technological University MAS 714 September 18, 2018 1 / 26 Flow Network A flow network is a
More informationGeometric Constraints II
Geometric Constraints II Realizability, Rigidity and Related theorems. Embeddability of Metric Spaces Section 1 Given the matrix D d i,j 1 i,j n corresponding to a metric space, give conditions under which
More informationCSE 202 Homework 4 Matthias Springer, A
CSE 202 Homework 4 Matthias Springer, A99500782 1 Problem 2 Basic Idea PERFECT ASSEMBLY N P: a permutation P of s i S is a certificate that can be checked in polynomial time by ensuring that P = S, and
More informationBranch-and-Bound. Leo Liberti. LIX, École Polytechnique, France. INF , Lecture p. 1
Branch-and-Bound Leo Liberti LIX, École Polytechnique, France INF431 2011, Lecture p. 1 Reminders INF431 2011, Lecture p. 2 Problems Decision problem: a question admitting a YES/NO answer Example HAMILTONIAN
More information(K2) For sum of the potential differences around any cycle is equal to zero. r uv resistance of {u, v}. [In other words, V ir.]
Lectures 16-17: Random walks on graphs CSE 525, Winter 2015 Instructor: James R. Lee 1 Random walks Let G V, E) be an undirected graph. The random walk on G is a Markov chain on V that, at each time step,
More informationOn dependent randomized rounding algorithms
Operations Research Letters 24 (1999) 105 114 www.elsevier.com/locate/orms On dependent randomized rounding algorithms Dimitris Bertsimas a;, Chungpiaw Teo b, Rakesh Vohra c a Sloan School of Management
More information