# A simpler and better derandomization of an approximation algorithm for Single Source Rent-or-Buy

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 A simpler and better derandomization of an approximation algorithm for Single Source Rent-or-Buy David P. Williamson Anke van Zuylen School of Operations Research and Industrial Engineering, Cornell University, Ithaca NY 14853, USA Abstract We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. Using the improved analysis of Eisenbrand, Grandoni and Rothvoß, our derandomized algorithm has an approximation guarantee of Keywords: Approximation algorithms, Derandomization, Network Design, Rent-or-Buy. 1 Introduction In the Multicommodity Rent-or-Buy problem, we are given an undirected graph G = V, E where each edge e E has a nonnegative cost c e, a set of terminal pairs {s 1,t 1,...,s k,t k } V V, and a parameter M > 1. A solution is a set of paths, one for each vertex pair. For each edge in the solution, we can either choose to rent the edge, incurring a cost c e for each path that uses the edge e, or we can buy the edge, incurring a cost Mc e. The special case when s i = s for every pair i = 1,..., k is called the Single Source Rent-or-Buy problem. A related problem is the Connected Facility Location problem. Here we are again given an undirected graph G = V,E with nonnegative edge costs c e, and a parameter M > 1, and we are given a set of demand points D V. A solution is a set of facilities F V, a connected subgraph T of G that spans F, and an assignment of demand points to open facilities. The cost of a solution is M times the cost of the edges in T, plus for each demand point j D, the cost of the shortest path di,j from j to the facility i F that j is assigned to. Note that we can assume without loss of generality that T is a Steiner tree on F, and that a root r V is given, such that r F must be satisfied for any solution. Single Source Rent-or-Buy can then be formulated as a Connected Facility Location problem with root s and D = {t 1,...,t k }, since it is not hard to show that the edges bought in a solution to Single Source Rent-or-Buy form a tree rooted at the source. Gupta et al. [8] gave the following approximation algorithm SimpleCFL for Connected Facility Location and Single Source Rent-or-Buy, with = 1: 1. Mark each demand j D independently with probability M, and let D be the random set of marked demands. 2. Construct an α-approximate Steiner tree on D {r} and buy the edges of this tree. 3. Assign each demand to its closest facility in D {r}.

3 Lemma 2.2 [8] For = 1, the expected cost of Step 3 of SimpleCFL is at most 2B OPT +R OPT. Lemma 2.3 [2] The expected cost of Step 3 of SimpleCFL is at most B OPT + 2R OPT. Corollary 2.1 [8] Using = 1, and using the 1.55-approximation algorithm from [10] in Step 2, SimpleCFL is an expected 3.55-approximation algorithm. Corollary 2.2 [2] Using = 0.591, and using the 1.55-approximation algorithm from [10] in Step 2, SimpleCFL is an expected 2.92-approximation algorithm. In theory, the randomized algorithm SimpleCFL can be derandomized by using the method of conditional expectation [3] as follows: Take an arbitrary vertex j in D. With probability M, this vertex will be included in D, and with probability 1 M it is not included in D. Therefore, the expected cost incurred by SimpleCFL is eual to M times the expected cost of SimpleCFL, conditioned on the fact that j D plus 1 M times the expected costs of SimpleCFL conditioned on j D. So it must be true that one of the two conditional expected cost is not more than the expected cost of SimpleCFL, and we choose whether or not we will include j in D to minimize the expected cost conditioned on this choice. We can repeat this process until we have decided for all vertices in D whether or not to include the vertex in D. Since each step does not increase the expected cost of the algorithm, we find a deterministic set D such that executing Steps 2 and 3 does not cost more than the expected cost of SimpleCFL. The problem with this approach for this particular problem is that we cannot compute the conditional expected cost of SimpleCFL exactly. However, we can compute the conditional expected assignment cost of SimpleCFL, since for each j D the expected assignment cost is just the distance to the closest vertex that is included in the random set D {r} see Claim 2.1. Furthermore, we will now show that there exists an easily computable value c ST D {r} that is not more than twice the cost of the Steiner tree on D {r} found by the primal-dual algorithm [1, 5]. We will show in the following lemma that given sets A,Ā D, such that we have already decided to open facilities in A so A D, and not to open facilities in Ā so Ā D =, that we can compute the conditional expectation of c ST D {r}. Lemma 2.4 For any subsets A,Ā D, we can compute E[ c STD {r} A D,Ā D = ] in polynomial time such that i E[ c ST D {r}] B OPT + R OPT ; ii The expected cost in Step 2 of SimpleCFL, conditioned on the fact that A D,Ā D =, when using a primal-dual algorithm to find a Steiner tree on D {r}, is at most 2E[ c ST D {r} A D,Ā D = ]. Proof : We use an idea similar to the one in the proof of Lemma 2.1: In Lemma 2.1 we used an optimal solution to the Connected Facility Location problem to exhibit a Steiner tree on D {r} that costs no more than B OPT + R OPT in expectation. Here, we will use the optimal solution to an LP relaxation of the Connected Facility Location problem to demonstrate a fractional Steiner tree on D {r}. The expected cost of this fractional Steiner tree will be at most B OPT + R OPT, and using a primal-dual algorithm we can compute a Steiner tree that costs no more than twice the cost of the fractional Steiner tree. 2

4 For a given set D, the cost of buying the Steiner tree found by the primal-dual algorithm on D {r} is at most twice the objective value of any feasible solution to the following LP [1, 5]: min e E Mc e y e BuyD s.t. y e 1 for all S s.t. D S,r S e δs y e 0. We will define a feasible solution to BuyD for every possible realization of D with the help of the following linear programming relaxation for Connected Facility Location [11]. Let x ij be a 0-1 variable that indicates whether demand vertex j is assigned to facility i, and let z e = 1 if edge e is bought, and 0 otherwise. The first set of constraints ensures that every demand is assigned to a facility. For any subset S V that does not contain the root r, such that j is assigned to some facility in S, any feasible solution must buy an edge that leaves S, which is enforced by the second set of constraints. min s.t. CFL B + R x ij = 1 j D e δs z e i S x ij j D,S V : r S B = e E Mc e z e R = di,jx ij j D x ij,z e,b,r 0. Let x,z,b,r be an optimal solution to CFL. Note that B +R B OPT +R OPT, because the optimal solution to the Connected Facility Location problem gives a feasible solution to CFL with objective value B OPT + R OPT. Let e = 1 if e is on the shortest path from demand j to node i note that e is a constant, not a decision variable. For a given set D let ỹ e D = z e + j D e x ij e E. We define c ST D {r} to be the objective value of {ỹ e D} e E for BuyD, i.e. e E Mc eỹ e D. Note that after solving CFL and getting x,z we can compute E[ c ST D {r} A D,Ā D = ] as E[ c ST D {r} A D,Ā D = ] = Mc e z e + e x ij + M χij e x ij. e E j A j D\A Ā 3

5 Then E[ c ST D {r}] = Mc e ze + M χij e x ij e E j D = Mc e ze + e c e x ij e E j D e E = Mc e ze + di,jx ij = B + R B OPT + R OPT. e E j D It remains to show that {ỹ e D} e E is a feasible solution to BuyD: Consider a set S such that r S, and there exists j D S. Then e x ij e x ij = x ij e x ij. i S i S e δs e δs i S e δs The last ineuality follows from the fact that if i S,j S then the shortest i j path must go from S to V \S, so e δs χij e 1. The feasibility of x,z to CFL gives that Therefore e δs ỹ e D = e δsz e + j D e δs z e i S e x ij x ij. e δsz e + e x ij x ij + x ij = 1. i S i S So {ỹ e D} e E is a feasible solution to BuyD. Theorem 2.1 SimpleCFL can be derandomized to get a deterministic 4-approximation algorithm for Connected Facility Location using = 1, and a 3.28-approximation algorithm using = Proof : We show that for we can derandomize SimpleCFL and get a 2+2-approximation algorithm. We begin by noting that, even though we are allowed to open a facility in any vertex in V, SimpleCFL only randomly chooses vertices from D to open facilities. In the derandomization, we will therefore also only consider the vertices in D as possible sites for facilities. Suppose the vertices in D are numbered v 1,...,v D. We will iterate through the vertices in D, and in iteration l we decide whether or not to open a facility in v l. We let A D be the set of vertices for which we have already decided to open a facility, and Ā D is the set of vertices for which we have already decided not to open a facility. Initially, A,Ā =. Let E[c R D {r} A D,Ā D = ] be the expected assignment cost incurred by SimpleCFL, conditioned on the fact that A D,Ā D =. Claim 2.1 For given subsets A,Ā D, we can efficiently compute E[c RD {r} A D,Ā D = ]. For a given demand vertex j D\A, we order the nodes in D\Ā {r} according to their nondecreasing shortest path distance from j. Let j1,j2,...,j be the ordered set of nodes. Let l be the first index such that jl A {r}, i.e. l is the first index for which we are sure to open a facility at jl, and for all earlier indices k we 4

6 open a facility at jk with probability M. Then the conditional expected assignment cost for j is l 1 1 k 1 M M djk,j + 1 l 1 djl,j M k=1 and we obtain the total expected assignment cost by summing over all j D\A. Let E[ c ST D {r} A D,Ā D = ] be given by Lemma 2.4. Let OPT = BOPT + R OPT be the cost of the optimal solution. We maintain the invariant that 2E[ c ST D {r} A D,Ā D = ] + E[c RD {r} A D,Ā D = ] 2 + 2OPT. Note that initially, when A,Ā =, the invariant holds for = 1 by Lemma 2.4i and Lemma 2.2. Using the improved analysis from [2], we can make the stronger statement that the invariant initially holds for any 0.636, since by Lemma 2.4i and Lemma 2.3 the left hand side is at most B OPT R OPT, and for Now, suppose we have already decided for v 1,...,v l 1 whether or not to open a facility, and A {v 1,...,v l 1 } contains the vertices at which we decided to open a facility, and Ā = {v 1,...,v l 1 }\A is the set of vertices at which we will not open a facility. Since 2E[ c ST D {r} A D,Ā D = ] + E[c RD {r} A D,Ā D = ] = 2E[ c ST D {r} A {v l } D,Ā M D = ] + E[c RD {r} A {v l } D,Ā D = ] + 1 2E[ c ST D {r} A D,Ā M {v l} D = ] + E[c R D {r} A D,Ā {v l} D = ], 2E[ c ST D {r} A {v l } D,Ā D = ]+E[c RD {r} A {v l } D,Ā D = ] the smaller of and 2E[ c ST D {r} A D,Ā {v l} D = ]+E[c R D {r} A D,Ā {v l} D = ] be at most 2 + 2OPT and we choose to include v l in A or Ā accordingly. At the end of the last iteration, we have obtained two disjoint sets A,Ā such that A Ā = D. Note that the conditional expectations are now constants. By Lemma 2.4ii, buying the Steiner tree constructed by the primal-dual algorithm on A {r} costs at most 2E[ c ST D {r} A D,Ā D = ], the assignment cost of the vertices in Ā to the closest facility in A {r} is eual to E[ c R D {r} A D,Ā D = ], and by the invariant the total cost of this solution is at most 2 + 2OPT. Remark. The ideas from Lemma 2.4 can also be applied to the boosted sampling algorithm for Multicommodity Rent-or-Buy. However, we do not have an easy way of computing the expected renting costs as we did in Claim 2.1, since the renting cost will depend heavily on the forest that is bought. Acknowledgement This research was supported by NSF grant CCF must 5

7 References [1] Ajit Agrawal, Philip Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput., 243: , [2] Friedrich Eisenbrand, Fabrizio Grandoni, and Thomas Rothvoß. A tighter analysis of random sampling for connected facility location. Submitted, [3] Paul Erdős and Joel Spencer. Probabilistic methods in combinatorics. Academic Press, [4] Lisa Fleischer, Jochen Könemann, Stefano Leonardi, and Guido Schäfer. Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. In STOC 06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pages ACM Press, [5] Michel X. Goemans and David P. Williamson. A general approximation techniue for constrained forest problems. SIAM J. Comput., 242: , [6] Anupam Gupta, Amit Kumar, Martin Pál, and Tim Roughgarden. Approximation via costsharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In FOCS 03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages IEEE Computer Society, [7] Anupam Gupta, Amit Kumar, Martin Pál, and Tim Roughgarden. Approximation via costsharing: Simpler and better approximation algorithms for network design. Submitted, [8] Anupam Gupta, Amit Kumar, and Tim Roughgarden. Simpler and better approximation algorithms for network design. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pages ACM Press, [9] Anupam Gupta, Aravind Srinivasan, and Éva Tardos. Cost-sharing mechanisms for network design. In APPROX-RANDOM, pages , [10] Gabriel Robins and Alexander Zelikovsky. Tighter bounds for graph Steiner tree approximation. SIAM J. Discrete Math., 191: , [11] Chaitanya Swamy and Amit Kumar. Primal-dual algorithms for connected facility location problems. Algorithmica, 404: ,

### Steiner Tree Approximation via IRR. Randomized Rounding

Steiner Tree Approximation via Iterative Randomized Rounding Graduate Program in Logic, Algorithms and Computation μπλ Network Algorithms and Complexity June 18, 2013 Overview 1 Introduction Scope Related

### Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

### Lecture 7: Approximation via Randomized Rounding

Lecture 7: Approximation via Randomized Rounding Often LPs return a fractional solution where the solution x, which is supposed to be in {0, } n, is in [0, ] n instead. There is a generic way of obtaining

### A short proof of the VPN Tree Routing Conjecture on ring networks

Operations Research Letters 36 (008 361 365 www.elsevier.com/locate/orl A short proof of the VPN Tree Routing Conjecture on ring networs Fabrizio Grandoni a, Voler Kaibel b, Gianpaolo Oriolo c,, Martin

### On the complexity of the asymmetric VPN problem

On the complexity of the asymmetric VPN problem Thomas Rothvoß & Laura Sanità Institute of Mathematics EPFL, Lausanne ISMP 09 Concave Cost VPN Given: Undirected graph G = (V,E), costs c : E Q + Outgoing

### New Approaches for Virtual Private Network Design

New Approaches for Virtual Private Network Design Friedrich Eisenbrand 1, Fabrizio Grandoni 2, Gianpaolo Oriolo 3, and Martin Skutella 4 1 Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, D-66123

### princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

### On the k-path cover problem for cacti

On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Algorithms for Virtual Private Network Design

Algorithms for Virtual Private Network Design Diploma Thesis of Thomas Rothvoß Advised by Prof. Dr. Friedrich Eisenbrand Second reviewer PD Dr. Piotr Krysta Fachbereich Informatik Universität Dortmund

### Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques. My T. Thai

Approximation Algorithms: LP Relaxation, Rounding, and Randomized Rounding Techniques My T. Thai 1 Overview An overview of LP relaxation and rounding method is as follows: 1. Formulate an optimization

### The multi-integer set cover and the facility terminal cover problem

The multi-integer set cover and the facility teral cover problem Dorit S. Hochbaum Asaf Levin December 5, 2007 Abstract The facility teral cover problem is a generalization of the vertex cover problem.

### Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

### ! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. #-approximation algorithm.

Approximation Algorithms 11 Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of three

### Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,

### A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem

A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar Anupam Gupta Tim Roughgarden Abstract We present the first constant-factor approximation algorithm for network

### 2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

### A constant-factor approximation algorithm for the k-median problem

A constant-factor approximation algorithm for the k-median problem Moses Charikar Sudipto Guha Éva Tardos David B. Shmoys July 23, 2002 Abstract We present the first constant-factor approximation algorithm

### Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal ABSTACT Mohit Singh Tepper School of Business Carnegie Mellon University Pittsburgh, PA USA mohits@andrew.cmu.edu In the MINIMUM

### Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

### / Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry

600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Steiner Tree and TSP Date: 01/29/15 Scribe: Katie Henry 2.1 Steiner Tree Definition 2.1.1 In the Steiner Tree problem the input

### Nan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA

A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce

### Minimum Caterpillar Trees and Ring-Stars: a branch-and-cut algorithm

Minimum Caterpillar Trees and Ring-Stars: a branch-and-cut algorithm Luidi G. Simonetti Yuri A. M. Frota Cid C. de Souza Institute of Computing University of Campinas Brazil Aussois, January 2010 Cid de

### Math 443/543 Graph Theory Notes 4: Connector Problems

Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we

### Energy-efficient communication in multi-interface wireless networks

Energy-efficient communication in multi-interface wireless networks Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, and Evi Papaioannou Research Academic Computer Technology Institute

### ONLINE DEGREE-BOUNDED STEINER NETWORK DESIGN. Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015

ONLINE DEGREE-BOUNDED STEINER NETWORK DESIGN Sina Dehghani Saeed Seddighin Ali Shafahi Fall 2015 ONLINE STEINER FOREST PROBLEM An initially given graph G. s 1 s 2 A sequence of demands (s i, t i ) arriving

### Approximation Algorithms. Scheduling. Approximation algorithms. Scheduling jobs on a single machine

Approximation algorithms Approximation Algorithms Fast. Cheap. Reliable. Choose two. NP-hard problems: choose 2 of optimal polynomial time all instances Approximation algorithms. Trade-off between time

### Two General Methods to Reduce Delay and Change of Enumeration Algorithms

ISSN 1346-5597 NII Technical Report Two General Methods to Reduce Delay and Change of Enumeration Algorithms Takeaki Uno NII-2003-004E Apr.2003 Two General Methods to Reduce Delay and Change of Enumeration

### Network Design with Coverage Costs

Network Design with Coverage Costs Siddharth Barman 1 Shuchi Chawla 2 Seeun William Umboh 2 1 Caltech 2 University of Wisconsin-Madison APPROX-RANDOM 2014 Motivation Physical Flow vs Data Flow vs. Commodity

Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one

### ! Solve problem to optimality. ! Solve problem in poly-time. ! Solve arbitrary instances of the problem. !-approximation algorithm.

Approximation Algorithms Chapter Approximation Algorithms Q Suppose I need to solve an NP-hard problem What should I do? A Theory says you're unlikely to find a poly-time algorithm Must sacrifice one of

### Bargaining Solutions in a Social Network

Bargaining Solutions in a Social Network Tanmoy Chakraborty and Michael Kearns Department of Computer and Information Science University of Pennsylvania Abstract. We study the concept of bargaining solutions,

### Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

### Primal-Dual Schema for Capacitated Covering Problems

Primal-Dual Schema for Capacitated Covering Problems Tim Carnes and David Shmoys Cornell University, Ithaca NY 14853, USA Abstract. Primal-dual algorithms have played an integral role in recent developments

### Minimum Spanning Trees

Minimum Spanning Trees Algorithms and 18.304 Presentation Outline 1 Graph Terminology Minimum Spanning Trees 2 3 Outline Graph Terminology Minimum Spanning Trees 1 Graph Terminology Minimum Spanning Trees

### Constant Factor Approximation Algorithm for the Knapsack Median Problem

Constant Factor Approximation Algorithm for the Knapsack Median Problem Amit Kumar Abstract We give a constant factor approximation algorithm for the following generalization of the k-median problem. We

### Scheduling Shop Scheduling. Tim Nieberg

Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations

### Planar Tree Transformation: Results and Counterexample

Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem

### Approximating Average Distortion of Embeddings into Line

Approximating Average Distortion of Embeddings into Line Kedar Dhamdhere Carnegie Mellon University Joint work with Anupam Gupta, R. Ravi Finite metric spaces (V, d) is a finite metric space if V is a

### GENERATING LOW-DEGREE 2-SPANNERS

SIAM J. COMPUT. c 1998 Society for Industrial and Applied Mathematics Vol. 27, No. 5, pp. 1438 1456, October 1998 013 GENERATING LOW-DEGREE 2-SPANNERS GUY KORTSARZ AND DAVID PELEG Abstract. A k-spanner

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### Good luck, veel succes!

Final exam Advanced Linear Programming, May 7, 13.00-16.00 Switch off your mobile phone, PDA and any other mobile device and put it far away. No books or other reading materials are allowed. This exam

### Online Algorithms for Network Design

Online Algorithms for Network Design Adam Meyerson University of California, Los Angeles 3731J Boelter Hall Los Angeles, California 90095 awm@cs.ucla.edu ABSTRACT This paper presents the first polylogarithmic-competitive

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

### Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

Online Adwords Allocation Shoshana Neuburger May 6, 2009 1 Overview Many search engines auction the advertising space alongside search results. When Google interviewed Amin Saberi in 2004, their advertisement

### High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

### Online Degree-Bounded Steiner Network Design

Online Degree-Bounded Steiner Network Design The problem of satisfying connectivity demands on a graph while respecting given constraints has been a pillar of the area of network design since the early

### Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs

Analysis of Approximation Algorithms for k-set Cover using Factor-Revealing Linear Programs Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis Research Academic Computer Technology Institute

### Scheduling Single Machine Scheduling. Tim Nieberg

Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe

### Minimize subject to. x S R

Chapter 12 Lagrangian Relaxation This chapter is mostly inspired by Chapter 16 of [1]. In the previous chapters, we have succeeded to find efficient algorithms to solve several important problems such

### Trees and Fundamental Circuits

Trees and Fundamental Circuits Tree A connected graph without any circuits. o must have at least one vertex. o definition implies that it must be a simple graph. o only finite trees are being considered

### Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery

### Online Node-weighted Steiner Forest and Extensions via Disk Paintings

Online Node-weighted Steiner Forest and Extensions via Disk Paintings MohammadTaghi Hajiaghayi Computer Science Dept. Univ of Maryland College Park, MD, USA Email: hajiagha@cs.umd.edu Vahid Liaghat Computer

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design

Bicolored Shortest Paths in Graphs with Applications to Network Overlay Design Hongsik Choi and Hyeong-Ah Choi Department of Electrical Engineering and Computer Science George Washington University Washington,

Buy-at-Bulk Network Design Baruch Awerbuch Department of Computer Science Johns Hopkins University Baltimore, MD 21218 Yossi Azar y Department of Computer Science Tel Aviv University Tel Aviv 69978, Israel

### An Approximation Algorithm for Bounded Degree Deletion

An Approximation Algorithm for Bounded Degree Deletion Tomáš Ebenlendr Petr Kolman Jiří Sgall Abstract Bounded Degree Deletion is the following generalization of Vertex Cover. Given an undirected graph

### Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing

Optimal Bandwidth Reservation in Hose-Model VPNs with -Path Routing Thomas Erlebach Computer Engineering and Networks Laboratory (TIK) Dept. of Information Technology and Electrical Engineering ETH Zürich,

### Inverse Optimization by James Orlin

Inverse Optimization by James Orlin based on research that is joint with Ravi Ahuja Jeopardy 000 -- the Math Programming Edition The category is linear objective functions The answer: When you maximize

### ARTICLE IN PRESS. European Journal of Operational Research xxx (2004) xxx xxx. Discrete Optimization. Nan Kong, Andrew J.

A factor 1 European Journal of Operational Research xxx (00) xxx xxx Discrete Optimization approximation algorithm for two-stage stochastic matching problems Nan Kong, Andrew J. Schaefer * Department of

### Algorithm Design and Analysis

Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;

### Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs Leah Epstein Magnús M. Halldórsson Asaf Levin Hadas Shachnai Abstract Motivated by applications in batch scheduling of jobs in manufacturing

### On the Multiple Unicast Network Coding Conjecture

On the Multiple Unicast Networ Coding Conjecture Michael Langberg Computer Science Division Open University of Israel Raanana 43107, Israel miel@openu.ac.il Muriel Médard Research Laboratory of Electronics

### Ecient approximation algorithm for minimizing makespan. on uniformly related machines. Chandra Chekuri. November 25, 1997.

Ecient approximation algorithm for minimizing makespan on uniformly related machines Chandra Chekuri November 25, 1997 Abstract We obtain a new ecient approximation algorithm for scheduling precedence

### An Exact Algorithm for Steiner Tree Problem on Graphs

International Journal of Computers, Communications & Control Vol. I (2006), No. 1, pp. 41-46 An Exact Algorithm for Steiner Tree Problem on Graphs Milan Stanojević, Mirko Vujošević Abstract: The paper

### arxiv:1203.1525v1 [math.co] 7 Mar 2012

Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

### Problem Set 7 Solutions

8 8 Introduction to Algorithms May 7, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Handout 25 Problem Set 7 Solutions This problem set is due in

### Data Caching in Networks with Reading, Writing and Storage Costs

Data Caching in Networks with Reading, 1 Writing and Storage Costs Himanshu Gupta Computer Science Department Stony Brook University Stony Brook, NY 11790 Email: hgupta@cs.sunysb.edu Bin Tang Computer

### 8.1 Min Degree Spanning Tree

CS880: Approximations Algorithms Scribe: Siddharth Barman Lecturer: Shuchi Chawla Topic: Min Degree Spanning Tree Date: 02/15/07 In this lecture we give a local search based algorithm for the Min Degree

### Applied Algorithm Design Lecture 5

Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 Cristina Bazgan a and Zsolt Tuza b,c,d a LAMSADE, Université Paris-Dauphine, Place du Marechal de Lattre de Tassigny, F-75775 Paris

### GRAPH THEORY and APPLICATIONS. Trees

GRAPH THEORY and APPLICATIONS Trees Properties Tree: a connected graph with no cycle (acyclic) Forest: a graph with no cycle Paths are trees. Star: A tree consisting of one vertex adjacent to all the others.

### Steiner Tree NP-completeness Proof

Steiner Tree NP-completeness Proof Alessandro Santuari May 7, 2003 Abstract This document is an eercise for the Computational Compleity course taken at the University of Trento. We propose an NP-completeness

### 5.1 Bipartite Matching

CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson

### Offline sorting buffers on Line

Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com

### Resource Allocation with Time Intervals

Resource Allocation with Time Intervals Andreas Darmann Ulrich Pferschy Joachim Schauer Abstract We study a resource allocation problem where jobs have the following characteristics: Each job consumes

### CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma

CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are

### The Approximability of the Binary Paintshop Problem

The Approximability of the Binary Paintshop Problem Anupam Gupta 1, Satyen Kale 2, Viswanath Nagarajan 2, Rishi Saket 2, and Baruch Schieber 2 1 Dept. of Computer Science, Carnegie Mellon University, Pittsburgh

### List Scheduling in Order of α-points on a Single Machine

List Scheduling in Order of α-points on a Single Machine Martin Skutella Fachbereich Mathematik, Universität Dortmund, D 4422 Dortmund, Germany martin.skutella@uni-dortmund.de http://www.mathematik.uni-dortmund.de/

### OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION

OPTIMAL DESIGN OF DISTRIBUTED SENSOR NETWORKS FOR FIELD RECONSTRUCTION Sérgio Pequito, Stephen Kruzick, Soummya Kar, José M. F. Moura, A. Pedro Aguiar Department of Electrical and Computer Engineering

### Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002

Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002 Eric Vigoda Scribe: Varsha Dani & Tom Hayes 1.1 Introduction The aim of this

### Graph Security Testing

JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 23 No. 1 (2015), pp. 29-45 Graph Security Testing Tomasz Gieniusz 1, Robert Lewoń 1, Michał Małafiejski 1 1 Gdańsk University of Technology, Poland Department of

### Graph. Consider a graph, G in Fig Then the vertex V and edge E can be represented as:

Graph A graph G consist of 1. Set of vertices V (called nodes), (V = {v1, v2, v3, v4...}) and 2. Set of edges E (i.e., E {e1, e2, e3...cm} A graph can be represents as G = (V, E), where V is a finite and

### Duplicating and its Applications in Batch Scheduling

Duplicating and its Applications in Batch Scheduling Yuzhong Zhang 1 Chunsong Bai 1 Shouyang Wang 2 1 College of Operations Research and Management Sciences Qufu Normal University, Shandong 276826, China

### Even Faster Algorithm for Set Splitting!

Even Faster Algorithm for Set Splitting! Daniel Lokshtanov Saket Saurabh Abstract In the p-set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective

### Graphs and Network Flows IE411 Lecture 1

Graphs and Network Flows IE411 Lecture 1 Dr. Ted Ralphs IE411 Lecture 1 1 References for Today s Lecture Required reading Sections 17.1, 19.1 References AMO Chapter 1 and Section 2.1 and 2.2 IE411 Lecture

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Distributed Network Monitoring and Multicommodity Flows: A Primal-Dual Approach

Distributed Network Monitoring and Multicommodity Flows: A Primal-Dual Approach Baruch Awerbuch Johns Hopkins University. baruch@cs.jhu.edu Rohit Khandekar IBM T.J. Watson Research Center. rkhandekar@gmail.com.

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

### 9th Max-Planck Advanced Course on the Foundations of Computer Science (ADFOCS) Primal-Dual Algorithms for Online Optimization: Lecture 1

9th Max-Planck Advanced Course on the Foundations of Computer Science (ADFOCS) Primal-Dual Algorithms for Online Optimization: Lecture 1 Seffi Naor Computer Science Dept. Technion Haifa, Israel Introduction

### metric space, approximation algorithm, linear programming relaxation, graph

APPROXIMATION ALGORITHMS FOR THE 0-EXTENSION PROBLEM GRUIA CALINESCU, HOWARD KARLOFF, AND YUVAL RABANI Abstract. In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals

### 11. APPROXIMATION ALGORITHMS

11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Sybilproof Reputation Mechanisms

Sybilproof Reputation Mechanisms Alice Cheng Center for Applied Mathematics Cornell University, Ithaca, NY 14853 alice@cam.cornell.edu Eric Friedman School of Operations Research and Industrial Engineering