# Dominating Set. Chapter 7

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 of the network graph. As it is the case for the MIS, an efficient dominating set algorithm can be used as a basic building block to solve a number of problems in distributed computing. For example, whenever we need to partition the network into a small number of local clusters, the computation of a small dominating set usually occurs in some way. A particularly important application of dominating sets is the construction of an efficient backbone for routing. Definition 7.1 (Dominating Set). Given an undirected graph G =(V,E), a dominating set is a subset S V of its nodes such that for all nodes v V, either v S or a neighbor u of v is in S. Remarks: It is well-known that computing a dominating set of minimal size is NPhard. We therefore look for approximation algorithms, that is, algorithms which produce solutions which are optimal up to a certain factor. Note that every MIS (cf. Chapter 6) is a dominating set. In general, the size of every MIS can however be larger than the size of an optimal minimum dominating set by a factor of Ω(n). As an example, connect the centers of two stars by an edge. Every MIS contains all the leaves of at least one of the two stars whereas there is a dominating set of size 2. All the dominating set algorithms that we study throughout this chapter operate in the following way. We start with S = and add nodes to S until S is a dominating set. To simplify presentation, we color nodes according to their state during the execution of an algorithm. We call nodes in S black, nodes which are covered (neighbors of nodes in S) gray, and all uncovered nodes white. By W (v), we denote the set of white nodes among the direct neighbors of v, including v itself. We call w(v) = W (v) the span of v. 63

2 64 CHAPTER 7. DOMINATING SET 7.1 Sequential Greedy Algorithm Intuitively, to end up with a small dominating set S, nodesins need to cover as many neighbors as possible. It is therefore natural to add nodes v with a large span w(v) to S. This idea leads to a simple greedy algorithm: Algorithm 33 Greedy Algorithm 1: S := ; 2: while white nodes do 3: choose v x w(x) = max u V {w(u)} ; 4: S := S {v}; 5: end while Theorem 7.2. The Greedy Algorithm computes a (ln + 2)-approximation, that is, for the computed dominating set S and an optimal dominating set S, we have S S ln + 2. Proof. Each time, we choose a new node of the dominating set (each greedy step), we have cost 1. Instead of letting this node pay the whole cost, we distribute the cost equally among all newly covered nodes. Assume that node v, chosen in line 3 of the algorithm, is white itself and that its white neighbors are v 1, v 2, v 3, and v 4. In this case each of the 5 nodes v and v 1,...,v 4 get charged 1/5. If v is chosen as a gray node, only the nodes v 1,...,v 4 get charged (they all get 1/4). Now, assume that we know an optimal dominating set S. By the definition of dominating sets, to each node which is not in S, we can assign a neighbor from S. By assigning each node to exactly one neighboring node of S,the graph is decomposed into stars, each having a dominator (node in S ) as center and non-dominators as leaves. Clearly, the cost of an optimal dominating set is 1 for each such star. In the following, we show that the amortized cost (distributed costs) of the greedy algorithm is at most ln + 2 for each star. This suffices to prove the theorem. Consider a single star with center v S before choosing a new node u in the greedy algorithm. The number of nodes that become dominated when adding u to the dominating set is w(u). Thus, if some white node v in the star of v becomes gray or black, it gets charged 1/w(u). By the greedy condition, u is a node with maximal span and therefore w(u) w(v ). Thus, v is charged at most 1/w(v ). After becoming gray, nodes do not get charged any more. Therefore first node that is covered in the star of v gets charged at most 1/(d(v ) + 1). Because w(v ) d(v ) when the second node is covered, the second node gets charged at most 1/d(v ). In general, the i th node that is covered in the star of v gets charged at most 1/(d(v )+i 2). Thus, the total amortized cost in the star of v is at most 1 d(v ) d(v ) = H(d(v ) + 1) H( + 1) < ln( ) + 2 where is the maximal degree of G and where H(n) = n number. i 1 1/i is the nth

3 7.2. DISTRIBUTED GREEDY ALGORITHM 65 Remarks: One can show that unless NP DTIME(n O(log log n) ), no polynomial-time algorithm can approximate the minimum dominating set problem better than (1 o(1)) ln. Thus, unless P NP, the approximation ratio of the simple greedy algorithm is optimal (up to lower order terms). 7.2 Distributed Greedy Algorithm For a distributed algorithm, we use the following observation. The span of a node can only be reduced if any of the nodes at distance at most 2 is included in the dominating set. Therefore, if the span of node v is greater than the span of any other node at distance at most 2 from v, the greedy algorithm chooses v before any of the nodes at distance at most 2. This leads to a very simple distributed version of the greedy algorithm. Every node v executes the following algorithm. Algorithm 34 Distributed Greedy Algorithm (at node v): 1: while v has white neighbors do 2: compute span w(v); 3: send w(v) to nodes at distance at most 2; 4: if w(v) largest within distance 2 (ties are broken by IDs) then 5: join dominating set 6: end if 7: end while Theorem 7.3. Algorithm 34 computes a dominating set of size at most ln +2 times the size of an optimal dominating set in O(n) rounds. Proof. The approximation quality follows directly from the above observation and the analysis of the greedy algorithm. The time complexity is at most linear because in every iteration of the while loop, at least one node is added to the dominating set and because one iteration of the while loop can be implemented in a constant number of rounds. The approximation ratio of the above distributed algorithm is best possible (unless P NP or unless we allow local computations to be exponential). However, the time complexity is very bad. In fact, there really are graphs on which in each iteration of the while loop, only one node is added to the dominating set (even if IDs are chosen randomly). As an example, consider a graph as in Figure 7.1. An optimal dominating set consists of all nodes on the center axis. The distributed greedy algorithm computes an optimal dominating set, however, the nodes are chosen sequentially from left to right. Hence, the running time of the algorithm on the graph of Figure 7.1 is Ω( n). Below, we will see that there are graphs on which Algorithm 34 even needs Ω(n) rounds. The problem of the graph of Figure 7.1 is that there is a long path of descending degrees (spans). Every node has to wait for the neighbor to the left. Therefore, we want to change the algorithm in such a way that there are no long

4 66 CHAPTER 7. DOMINATING SET Figure 7.1: Distributed greedy algorithm: Bad example Figure 7.2: Distributed greedy algorithm with rounded spans: Bad example paths of descending spans. Allowing for an additional factor 2 in the approximation ratio, we can round all spans to the next power of 2 and let the greedy algorithm take a node with a maximal rounded span. In this case, a path of strictly descending rounded spans has length at most log n. For the distributed version, this means that nodes with maximal rounded span within distance 2 are added to the dominating set. Ties are again broken by unique node IDs. If node IDs are chosen at random, the time complexity for the graph of Figure 7.1 is reduced from Ω( n)too(log n). Unfortunately, there still is a problem remaining. To see this, we consider Figure 7.2. The graph of Figure 7.2 consists of a clique with n/3 nodes and two leaves per node of the clique. An optimal dominating set consists of all the n/3 nodes of the clique. Because they all have distance 1 from each other, the described distributed algorithm only selects one in each while iteration (the one with the largest ID). Note that as soon as one of the nodes is in the dominating set, the span of all remaining nodes of the clique is 2. They do not have common neighbors and therefore there is no reason not to choose all of them in parallel. However, the time complexity of the simple algorithm is Ω(n). In order to improve this example, we need an algorithm that can choose many nodes simultaneously as long as these nodes do not interfere too much, even if they are neighbors. In Algorithm 35, N(v) denotes the set of neighbors of v (including v itself) and N 2 (v) = u N(V ) N(u) are the nodes at distance at most 2 of v. As before, W (v) = u N(v) :u is white and w(v) = W (v). It is clear that if Algorithm 35 terminates, it computes a valid dominating set. We will now show that the computed dominating set is small and that the algorithm terminates quickly.

5 7.2. DISTRIBUTED GREEDY ALGORITHM 67 Algorithm 35 Fast Distributed Dominating Set Algorithm (at node v): 1: W (v) :=N(v); w(v) := W (v) ; 2: while W (v) = do 3: w(v) :=2 log 2 w(v) ; // round down to next power of 2 4: ŵ(v) := max u N2(v) w(u); 5: if w(v) =ŵ(v) then v.active := true else v.active := false end if; 6: compute support s(v) := {u N(v) :u.active = true} ; 7: ŝ(v) := max u W (v) s(u); 8: v.candidate := false; 9: if v.active then 10: v.candidate := true with probability 1/ŝ(v) 11: end if; 12: compute c(v) := {u N(v) :u.candidate = true} ; 13: if v.candidate and u W (v) c(u) 3w(v) then 14: node v joins dominating set 15: end if 16: W (v) :={u N(v) :u is white}; w(v) := W (v) ; 17: end while Theorem 7.4. Algorithm 35 computes a dominating set of size at most (6 ln + 12) S, where S is an optimal dominating set. Proof. The proof is a bit more involved but analogous to the analysis of the approximation ratio of the greedy algorithm. Every time, we add a new node v to the dominating set, we distribute the cost among v (if it is still white) and its white neighbors. Consider an optimal dominating set S. As in the analysis of the greedy algorithm, we partition the graph into stars by assigning every node u not in S to a neighbor v in S. We want to show that the total distributed cost in the star of every v S is at most 6H( + 1). Consider a node v that is added to the dominating set by Algorithm 35. Let W (v) be the set of white nodes in N(v) whenv becomes a dominator. For a node u W (v) letc(u) be the number of candidate nodes in N(u). We define C(v) = u W (v) c(u). Observe that C(v) 3w(v) because otherwise v would not join the dominating set in line 15. When adding v to the dominating set, every newly covered node u W (v) is charged 3/(c(u)w(v)). This compensates the cost 1 for adding v to the dominating set because u W (v) 3 c(u)w(v) w(v) 3 w(v) u W (v) c(u)/w(v) = 3 C(v)/w(v) 1. The first inequality follows because it can be shown that for α i > 0, k i=1 1/α i k/ᾱ where ᾱ = k i=1 α i/k. Now consider a node v S and assume that a white node u W (v )turns gray or black in iteration t of the while loop. We have seen that u is charged 3/(c(u)w(v)) for every node v N(u) that joins the dominating set in iteration t. Since a node can only join the dominating set if its span is largest up to a factor of two within two hops, we have w(v) w(v )/2 for every node v N(u) that joins the dominating set in iteration t. Because there are at most c(u) such nodes, the charge of u is at most 6/w(v ). Analogously to the sequential greedy

6 68 CHAPTER 7. DOMINATING SET algorithm, we now get that the total cost in the star of a node v S is at most N(v ) i=1 6 i 6 H( N(v ) ) 6 H( + 1) = 6 ln To bound the time complexity of the algorithm, we first need to prove the following lemma. Lemma 7.5. Consider an iteration of the while loop. Assume that a node u is white and that 2s(u) max v A(u) ŝ(v) where A(u) ={v N(u) :v.active = true}. Then, the probability that u becomes dominated (turns gray or black) in the considered while loop iteration is larger than 1/9. Proof. Let D(u) be the event that u becomes dominated in the considered while loop iteration, i.e., D(u) is the event that u changes its color from white to gray or black. Thus, we need to prove that Pr D(u) > 1/9. We can write this probability as Pr D(u) =Pr c(u) > 0 Pr D(u) c(u) > 0 +Pr c(u) =0 Pr D(u) c(u) =0. =0 It is therefore sufficient to lower bound the probabilities Pr c(u) > 0 and Pr D(u) c(u) > 0.Wehave2s(u) max v A(u) ŝ(v). Therefore, in line 10, each of the s(u) active nodes v N(u) becomes a candidate node with probability 1/ŝ(v) 1/(2s(u)). The probability that at least one of the s(u) active nodes in N(u) becomes a candidate therefore is Pr[c(u) > 0] > s(u) s(u) > 1 1 e > 1 3. We used that for x 1, (1 1/x) x < 1/e. We next want to bound the probability Pr D(u) c(u) > 0 that at least one of the c(u) candidates in N(u) joins the dominating set. We have Pr D(u) c(u) > 0 min Pr v joins dominating set v.candidate = true. v N(u) Consider some node v and let C(v) = v W (v) c(v ). If v is a candidate, it joins the dominating set if C(v) 3w(v). We are thus interested in the probability Pr C(v) 3w(v) v.candidate = true. Assume that v is a candidate. Let c (v ) = c(v ) 1 be the number of candidates in N(v ) \{v}. For a node v W (v), c (v ) is upper bounded by a binomial random variable Bin s(v ) 1, 1/s(v ) with expectation (s(v ) 1)/s(v ). We therefore have E c(v ) v.candidate = true = 1+E c (v ) =1+ s(v ) 1 s(v ) By linearity of expectation, we hence obtain E C(v) v.candidate = true = v W (v) < 2w(v). < 2. E c(v ) v.candidate = true

7 7.2. DISTRIBUTED GREEDY ALGORITHM 69 We can now use Markov s inequality to bound the probability that C(v) becomes too large: Pr C(v) > 3w(v) v.candidate = true < 2 3. Combining everything, we get and hence Pr v joins dom. set v.candidate = true = Pr C(v) 3w(v) v.candidate = true > 1 3 Pr D(u) =Pr c(u) > 0] Pr D(u) c(u) > 0 > = 1 9. Theorem 7.6. In expectation, Algorithm 35 terminates in O(log 2 log n) rounds. Proof. First observe that every iteration of the while loop can be executed in a constant number of rounds. Consider the state after t iterations of the while loop. Let w max (t) = max v V w(v) be the maximal span rounded down to the next power of 2 after t iterations. Further, let s max (t) be the maximal support s(v) of any node v for which there is a node u N(v) withw(u) w max (t) after t while loop iterations. Observe that all nodes v with w(v) w max (t) are active in iteration t + 1 and that as long as the maximal rounded span w max (t) does not change, s max (t) can only get smaller with increasing t. Consider the pair ( w max,s max ) and define a relation such that (w,s ) (w, s) iffw <w or w = w and s s/2. From the above observations, it follows that ( w max (t),s max (t)) ( w max (t ),s max (t )) = t>t. (7.1) For a given time t, lett (t) be the first time for which ( w max (T (t)),s max (T (t))) ( w max (t),s max (t)). We first want to show that for all t, E[T (t) t] = O(log n). (7.2) Let us look at the state after t while loop iterations. By Lemma 7.5, every white node u with support s(u) s max (t)/2 will be dominated after the following while loop iteration with probability larger than 1/9. Consider a node u that satisfies the following three conditions: (1) u is white (2) v N(u) :w(v) w max (t) (3) s(u) s max (t)/2.

8 70 CHAPTER 7. DOMINATING SET As long as u satisfies all three conditions, the probability that u becomes dominated is larger than 1/9 in every while loop iteration. Hence, after t+τ iterations (from the beginning), u is dominated or does not satisfy (2) or (3) with probability larger than (8/9) τ. Choosing τ = log 9/8 (2n), this probability becomes 1/(2n). There are at most n nodes u satisfying Conditions (1) (3). Therefore, applying a union bound, we obtain that with probability more than 1/2, there is no white node u satisfying Conditions (1) (3) at time t + log 9/8 (2n). Equivalently, with probability more than 1/2, T (t) t + log 9/8 (2n). Analogously, we obtain that with probability more than 1/2 k, T (t) t + k log 9/8 (2n). We then have E[T (t) t] = Pr[T (t) t = τ] τ τ=1 k=1 1 2 k 1 2 k+1 k log 9/8 (2n) = log 9/8 (2n) and thus Equation (7.2) holds. Let t 0 = 0 and t i = T (t i 1 ) for i =1,...,k. where t k =min t w max (t) = 0. Because w max (t) = 0 implies that w(v) = 0 for all v V and that we therefore have computed a dominating set, by Equations (7.1) and (7.2) (and linearity of expectation), the expected number of rounds until Algorithm 35 terminates is O(k log n). Since w max (t) can only have log different values and because for a fixed value of w max (t), the number of times s max (t) can be decreased by a factor of 2 is at most log times, we have k log 2. Remarks: It is not hard to show that Algorithm 35 even terminates in O(log 2 log n) rounds with probability 1 1/n c for an arbitrary constant c. Using the median of the supports of the neighbors instead of the maximum in line 8 results in an algorithm with time complexity O(log log n). With another algorithm, this can even be slightly improved to O(log 2 ). One can show that Ω(log ) rounds are necessary to obtain an O(log )- approximation. It is not known whether there is a fast deterministic approximation algorithm. This is an interesting and important open problem. The best deterministic algorithm known to achieve an O(log )-approximation has time complexity 2 O( log n).

### Distributed Computing over Communication Networks: Maximal Independent Set

Distributed Computing over Communication Networks: Maximal Independent Set What is a MIS? MIS An independent set (IS) of an undirected graph is a subset U of nodes such that no two nodes in U are adjacent.

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

### 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

### ! 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

### 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

### 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

### 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

### Guessing Game: NP-Complete?

Guessing Game: NP-Complete? 1. LONGEST-PATH: Given a graph G = (V, E), does there exists a simple path of length at least k edges? YES 2. SHORTEST-PATH: Given a graph G = (V, E), does there exists a simple

### 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,

### 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;

### 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 }

### Network File Storage with Graceful Performance Degradation

Network File Storage with Graceful Performance Degradation ANXIAO (ANDREW) JIANG California Institute of Technology and JEHOSHUA BRUCK California Institute of Technology A file storage scheme is proposed

### 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

### MapReduce and Distributed Data Analysis. Sergei Vassilvitskii Google Research

MapReduce and Distributed Data Analysis Google Research 1 Dealing With Massive Data 2 2 Dealing With Massive Data Polynomial Memory Sublinear RAM Sketches External Memory Property Testing 3 3 Dealing With

### Diversity Coloring for Distributed Data Storage in Networks 1

Diversity Coloring for Distributed Data Storage in Networks 1 Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Pasadena, CA 9115, U.S.A. {jax, bruck}@paradise.caltech.edu Abstract

### 1 The Line vs Point Test

6.875 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Low Degree Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz Having seen a probabilistic verifier for linearity

### 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

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### Optimal File Sharing in Distributed Networks

Optimal File Sharing in Distributed Networks Moni Naor Ron M. Roth Abstract The following file distribution problem is considered: Given a network of processors represented by an undirected graph G = (V,

### Competitive Analysis of On line Randomized Call Control in Cellular Networks

Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising

### 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

### An Empirical Study of Two MIS Algorithms

An Empirical Study of Two MIS Algorithms Email: Tushar Bisht and Kishore Kothapalli International Institute of Information Technology, Hyderabad Hyderabad, Andhra Pradesh, India 32. tushar.bisht@research.iiit.ac.in,

### Private Approximation of Clustering and Vertex Cover

Private Approximation of Clustering and Vertex Cover Amos Beimel, Renen Hallak, and Kobbi Nissim Department of Computer Science, Ben-Gurion University of the Negev Abstract. Private approximation of search

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### Minimum cost maximum flow, Minimum cost circulation, Cost/Capacity scaling

6.854 Advanced Algorithms Lecture 16: 10/11/2006 Lecturer: David Karger Scribe: Kermin Fleming and Chris Crutchfield, based on notes by Wendy Chu and Tudor Leu Minimum cost maximum flow, Minimum cost circulation,

### Solutions to Homework 6

Solutions to Homework 6 Debasish Das EECS Department, Northwestern University ddas@northwestern.edu 1 Problem 5.24 We want to find light spanning trees with certain special properties. Given is one example

### A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs

A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs Johannes Schneider, Roger Wattenhofer {jschneid, wattenhofer}@tik.ee.ethz.ch Computer Engineering and Networks Laboratory

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Tiers, Preference Similarity, and the Limits on Stable Partners

Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider

### Graphical degree sequences and realizations

swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös

### 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

### 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

### Near Optimal Solutions

Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.

### Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q...

Lecture 4 Scheduling 1 Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max structure of a schedule 0 Q 1100 11 00 11 000 111 0 0 1 1 00 11 00 11 00

### Find-The-Number. 1 Find-The-Number With Comps

Find-The-Number 1 Find-The-Number With Comps Consider the following two-person game, which we call Find-The-Number with Comps. Player A (for answerer) has a number x between 1 and 1000. Player Q (for questioner)

### 1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Supplementary Material for: van Rooij, I., Evans, P., Müller, M., Gedge, J. & Wareham, T. (2008). Identifying Sources of Intractability in Cognitive Models: An Illustration using Analogical Structure Mapping.

### Asking Hard Graph Questions. Paul Burkhardt. February 3, 2014

Beyond Watson: Predictive Analytics and Big Data U.S. National Security Agency Research Directorate - R6 Technical Report February 3, 2014 300 years before Watson there was Euler! The first (Jeopardy!)

### Why? A central concept in Computer Science. Algorithms are ubiquitous.

Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online

### 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

### 6.852: Distributed Algorithms Fall, 2009. Class 2

.8: Distributed Algorithms Fall, 009 Class Today s plan Leader election in a synchronous ring: Lower bound for comparison-based algorithms. Basic computation in general synchronous networks: Leader election

Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait

### Nimble Algorithms for Cloud Computing. Ravi Kannan, Santosh Vempala and David Woodruff

Nimble Algorithms for Cloud Computing Ravi Kannan, Santosh Vempala and David Woodruff Cloud computing Data is distributed arbitrarily on many servers Parallel algorithms: time Streaming algorithms: sublinear

### A Practical Scheme for Wireless Network Operation

A Practical Scheme for Wireless Network Operation Radhika Gowaikar, Amir F. Dana, Babak Hassibi, Michelle Effros June 21, 2004 Abstract In many problems in wireline networks, it is known that achieving

### arxiv:1412.2333v1 [cs.dc] 7 Dec 2014

Minimum-weight Spanning Tree Construction in O(log log log n) Rounds on the Congested Clique Sriram V. Pemmaraju Vivek B. Sardeshmukh Department of Computer Science, The University of Iowa, Iowa City,

### 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

### Dynamic TCP Acknowledgement: Penalizing Long Delays

Dynamic TCP Acknowledgement: Penalizing Long Delays Karousatou Christina Network Algorithms June 8, 2010 Karousatou Christina (Network Algorithms) Dynamic TCP Acknowledgement June 8, 2010 1 / 63 Layout

### Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks

Load-Balanced Virtual Backbone Construction for Wireless Sensor Networks Jing (Selena) He, Shouling Ji, Yi Pan, Zhipeng Cai Department of Computer Science, Georgia State University, Atlanta, GA, USA, {jhe9,

### Cost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:

CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm

### (67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7

(67902) Topics in Theory and Complexity Nov 2, 2006 Lecturer: Irit Dinur Lecture 7 Scribe: Rani Lekach 1 Lecture overview This Lecture consists of two parts In the first part we will refresh the definition

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### Well-Separated Pair Decomposition for the Unit-disk Graph Metric and its Applications

Well-Separated Pair Decomposition for the Unit-disk Graph Metric and its Applications Jie Gao Department of Computer Science Stanford University Joint work with Li Zhang Systems Research Center Hewlett-Packard

### 1 Approximating Set Cover

CS 05: Algorithms (Grad) Feb 2-24, 2005 Approximating Set Cover. Definition An Instance (X, F ) of the set-covering problem consists of a finite set X and a family F of subset of X, such that every elemennt

### 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

Université du Québec en Outaouais, Canada 1/46 Outline Intro Known Ad hoc GRN 1 Introduction 2 Networks with known topology 3 Ad hoc networks 4 Geometric radio networks 2/46 Outline Intro Known Ad hoc

### Efficient Throughput for Wireless Mesh Networks by CDMA/OVSF Code Assignment

Ad Hoc & Sensor Wireless Networks Vol. 00, pp. 1 27 Reprints available directly from the publisher Photocopying permitted by license only 2008 Old City Publishing, Inc. Published by license under the OCP

### Introduction to Algorithms. Part 3: P, NP Hard Problems

Introduction to Algorithms Part 3: P, NP Hard Problems 1) Polynomial Time: P and NP 2) NP-Completeness 3) Dealing with Hard Problems 4) Lower Bounds 5) Books c Wayne Goddard, Clemson University, 2004 Chapter

### JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004

Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February

### The Basics of Graphical Models

The Basics of Graphical Models David M. Blei Columbia University October 3, 2015 Introduction These notes follow Chapter 2 of An Introduction to Probabilistic Graphical Models by Michael Jordan. Many figures

### Diagonalization. Ahto Buldas. Lecture 3 of Complexity Theory October 8, 2009. Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.

Diagonalization Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee Background One basic goal in complexity theory is to separate interesting complexity

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

### What s next? Reductions other than kernelization

What s next? Reductions other than kernelization Dániel Marx Humboldt-Universität zu Berlin (with help from Fedor Fomin, Daniel Lokshtanov and Saket Saurabh) WorKer 2010: Workshop on Kernelization Nov

### Connected Identifying Codes for Sensor Network Monitoring

Connected Identifying Codes for Sensor Network Monitoring Niloofar Fazlollahi, David Starobinski and Ari Trachtenberg Dept. of Electrical and Computer Engineering Boston University, Boston, MA 02215 Email:

### 1. Write the number of the left-hand item next to the item on the right that corresponds to it.

1. Write the number of the left-hand item next to the item on the right that corresponds to it. 1. Stanford prison experiment 2. Friendster 3. neuron 4. router 5. tipping 6. small worlds 7. job-hunting

### 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

### Maximal Independent Sets in Multichannel Radio Networks

Maximal Independent Sets in Multichannel Radio Networks Sebastian Daum Dept. of Comp. Science U. of Freiburg, Germany Freiburg, Germany sdaum@cs.uni-freiburg.de Fabian Kuhn Dept. of Comp. Science U. of

### Efficient Fault-Tolerant Infrastructure for Cloud Computing

Efficient Fault-Tolerant Infrastructure for Cloud Computing Xueyuan Su Candidate for Ph.D. in Computer Science, Yale University December 2013 Committee Michael J. Fischer (advisor) Dana Angluin James Aspnes

### CSC2420 Fall 2012: Algorithm Design, Analysis and Theory

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms

### Key words. multi-objective optimization, approximate Pareto set, bi-objective shortest path

SMALL APPROXIMATE PARETO SETS FOR BI OBJECTIVE SHORTEST PATHS AND OTHER PROBLEMS ILIAS DIAKONIKOLAS AND MIHALIS YANNAKAKIS Abstract. We investigate the problem of computing a minimum set of solutions that

### 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,

### The Conference Call Search Problem in Wireless Networks

The Conference Call Search Problem in Wireless Networks Leah Epstein 1, and Asaf Levin 2 1 Department of Mathematics, University of Haifa, 31905 Haifa, Israel. lea@math.haifa.ac.il 2 Department of Statistics,

### 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

### 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

### SIMS 255 Foundations of Software Design. Complexity and NP-completeness

SIMS 255 Foundations of Software Design Complexity and NP-completeness Matt Welsh November 29, 2001 mdw@cs.berkeley.edu 1 Outline Complexity of algorithms Space and time complexity ``Big O'' notation Complexity

### New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks

0-7695-1435-9/0 \$17.00 (c) 00 IEEE 1 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS-35 0) 0-7695-1435-9/0 \$17.00 00 IEEE Proceedings of the 35th Hawaii International

### Graph models for the Web and the Internet. Elias Koutsoupias University of Athens and UCLA. Crete, July 2003

Graph models for the Web and the Internet Elias Koutsoupias University of Athens and UCLA Crete, July 2003 Outline of the lecture Small world phenomenon The shape of the Web graph Searching and navigation

### IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 3, JUNE 2011 709

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 19, NO 3, JUNE 2011 709 Improved Bounds on the Throughput Efficiency of Greedy Maximal Scheduling in Wireless Networks Mathieu Leconte, Jian Ni, Member, IEEE, R

### Energy Efficient Monitoring in Sensor Networks

Energy Efficient Monitoring in Sensor Networks Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi Computer Science Department, University of Maryland, A.V. Williams Building, College Park,

### Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06

CS880: Approximations Algorithms Scribe: Matt Elder Lecturer: Shuchi Chawla Topic: Greedy Approximations: Set Cover and Min Makespan Date: 1/30/06 3.1 Set Cover The Set Cover problem is: Given a set of

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Single-Link Failure Detection in All-Optical Networks Using Monitoring Cycles and Paths

Single-Link Failure Detection in All-Optical Networks Using Monitoring Cycles and Paths Satyajeet S. Ahuja, Srinivasan Ramasubramanian, and Marwan Krunz Department of ECE, University of Arizona, Tucson,

### Tutorial 8. NP-Complete Problems

Tutorial 8 NP-Complete Problems Decision Problem Statement of a decision problem Part 1: instance description defining the input Part 2: question stating the actual yesor-no question A decision problem

### 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

### Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new

Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of

### Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new GAP (2) Graph Accessibility Problem (GAP) (1)

Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of

### Single machine parallel batch scheduling with unbounded capacity

Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University

### Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected

### CSC2420 Spring 2015: Lecture 3

CSC2420 Spring 2015: Lecture 3 Allan Borodin January 22, 2015 1 / 1 Announcements and todays agenda Assignment 1 due next Thursday. I may add one or two additional questions today or tomorrow. Todays agenda

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### Data Streams A Tutorial

Data Streams A Tutorial Nicole Schweikardt Goethe-Universität Frankfurt am Main DEIS 10: GI-Dagstuhl Seminar on Data Exchange, Integration, and Streams Schloss Dagstuhl, November 8, 2010 Data Streams Situation:

### 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

### Online Client-Server Load Balancing Without Global Information

Online Client-Server Load Balancing Without Global Information Baruch Awerbuch Mohammad T. Hajiaghayi Robert Kleinberg Tom Leighton Abstract We consider distributed online algorithms for maximizing throughput

### Welcome to... Problem Analysis and Complexity Theory 716.054, 3 VU

Welcome to... Problem Analysis and Complexity Theory 716.054, 3 VU Birgit Vogtenhuber Institute for Software Technology email: bvogt@ist.tugraz.at office hour: Tuesday 10:30 11:30 slides: http://www.ist.tugraz.at/pact.html

### Protecting Neighbor Discovery Against Node Compromises in Sensor Networks

Protecting Neighbor Discovery Against Node Compromises in Sensor Networks Donggang Liu isec Laboratory, CSE Department The University of Texas at Arlington Abstract The neighborhood information has been

### Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li

Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order

### Notes from Week 1: Algorithms for sequential prediction

CS 683 Learning, Games, and Electronic Markets Spring 2007 Notes from Week 1: Algorithms for sequential prediction Instructor: Robert Kleinberg 22-26 Jan 2007 1 Introduction In this course we will be looking

### B490 Mining the Big Data. 2 Clustering

B490 Mining the Big Data 2 Clustering Qin Zhang 1-1 Motivations Group together similar documents/webpages/images/people/proteins/products One of the most important problems in machine learning, pattern

### The Butterfly, Cube-Connected-Cycles and Benes Networks

The Butterfly, Cube-Connected-Cycles and Benes Networks Michael Lampis mlambis@softlab.ntua.gr NTUA The Butterfly, Cube-Connected-Cycles and Benes Networks p.1/16 Introduction Hypercubes are computationally