# 18 Minimum Bandwidth Problem

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Our goal in the next three lectures will be to study the notion of Volume Respecting Embeddings. In this lecture we develop the basic framework and see how this idea is used to obtain a non-trivial approximation algorithm for problem of finding the minimum bandwidth layout of a graph. 18 Minimum Bandwidth Problem Definition 18.1 Given an unweighted graph G = (V, E) on n vertices, consider a 1-1 map f of the vertices V into [1, n]. The bandwidth of the map f is defined as the maximum stretch of any edge, i.e., bw(f) = max f(i) f(j). (i,j) E The bandwidth of a graph is defined as the minimum possible bandwidth achievable by any 1-1 map from V [1, n]. That is, bw(g) = min bw(f). f:v [1,n] The minimum bandwidth problem is quite hard even for very simple graphs. It is known to be NP-hard for trees, and in fact, even for trees that are caterpillars with hair length 3. Moreover, Unger (1998) showed that it is NP-Hard to approximate the bandwidth to within any constant factor for caterpillars as well. As an aside, the name bandwidth comes from matrix algorithms; one can think of a min-bandwidth algorithm as trying to find a permutation of the vertices, such that looking at the adjacency matrix under this permutation causes all non-zero entries to lie in a thin band along the diagonal. This is quite a useful operation, since matrix operations on matrices with small bandwidth requires less space and time; e.g., consider taking a matrix-vector product if the n n matrix has bandwidth B, then we need time O(nB), instead of O(n 2 ). The popular software package MatLab has an inbuilt beuristic to find a permutation of vertices with good bandwidth, which is a variation of one due to Cuthill and McKee. In this lecture we will be interested in approximation algorithms for this problem. A by-now classic result due to Uri Feige is that Theorem 18.2 (Feige (1998)) Given an unweighted graph G = (V, E), the minimum bandwidth bw(g) can be approximated to within a factor of O(log 3.5 n), where V = n. The proof of this result is extremely elegant, but it requires a few conceptual steps and quite a bit of machinery. The goal of this lecture, as well as the next two lectures, will be to develop this machinery. We will first begin with the following simpler result for trees. Theorem 18.3 (Gupta (2000)) For trees, the minimum bandwidth can be approximated to within a factor of O(log 2.5 n). XV-1

2 18.1 A Lower Bound on bw(g) We first give a simple lower bound on the bandwidth, on which all known approximation guarantees are based. To start off, note that if the maximum degree of a vertex in G is, then /2 is a lower bound on the bandwidth. This is because at least half its neighbours must be placed to one side of it, and the edge to the furthest neighbor on this heavier side must be stretched by at least /2. This idea can be naturally extended to look at local density around a vertex. For a vertex v and an integer r, let B(v, r) denote the set of vertices within distance r from v. Then, Lemma 18.4 For all v V and integers r, B(v, r) 1 /2r OP T Proof. Consider the layout of the neighbors of v in [1, n]. At least two of these, say u and w, have a distance of B(v, r) 1 on the line. Since the distance of u and w in G is at most 2r, it follows that some edge on the u-w path is stretched by at least B(v, r) 1/2r. Definition 18.5 The local density of a graph G is By Lemma 18.4, D bw(g). D = D(G) = min v min r B(v,r) 1 2r 19 Min-Bandwidth Algorithms for Trees To get a feel for the problem we first consider a couple of algorithms that do not work. These will give us important intuition for why the correct algorithm is defined the way it is Algorithm 1 Let us assume that the tree T = (V, E) is rooted at some vertex r. The first algorithm places vertics in order of their distance from the root, breaking ties arbitrarily. Algorithm 1: Perform a breadth first search (BFS) on the tree starting at the root r. Place the vertices on the line in the order you see them in this BFS traversal (i.e. place them in any order of distance from the root r). Lemma 19.6 There are trees for which the above algorithm performs Ω(n 1/2 ) worse than the local density D. Proof. Consider the n-vertex tree in Figure 19.1 below, which consists of n 1/2 /2 brooms hanging off the root. Each broom is a path consisting of n 1/2 vertices with a star consisting of n 1/2 vertices at the end of this path. All the brooms in the graph have the same length. It is easy to verify that the local density of this graph is D = Θ(n 1/2 ). We claim that Algorithm 1 produces a layout with bandwidth Ω(n). Indeed, if we consider a BFS traversal, then all the Ω( n) vertices b i will be laid out together, and followed by the Ω(n) leaves. Thus there is at least one b i -leaf edge that is stretched by Ω(n).. XV-2

3 Root r n n/2 Brooms b 1 b2 b3 bt Figure 19.1: The bad example 19.2 Another Attempt: Algorithm 2 The problem with the algorithm above is that if we consider the distances from the root, we could see too many vertices together; this leads to the high bandwidth. A way to beat this might be to randomize the distances of the vertices from the root (without changing them by too much). This motivates us to consider our next natural algorithm. Algorithm 2: Assign a length uniformly at random from the interval [1, 2] to each edge. Place the vertices on the line in the order of the distance from the root. However, it turns out that this algorithm is not too good either. We will now show that, Lemma 19.7 There are graphs on which the output of Algorithm 2 is greater than D by a factor of Ω(n 1/4 ) (ignoring polylog(n) factors). Proof. The bad example is the same tree in Figure??. Consider the n/2 leaves of the tree; their distance from the root is a sum of k = n i.i.d. random variables in [1, 2]. Now, by a Chernoff bound, the distance of a leaf from r lies in the range 3 2 k ± O( k log k) with probability 1 1/n 2. Hence, by a union bound, all the n/2 leaves lie in an interval of width O( k log k) = Õ(n1/4 ) with constant probability. Let us condition on that event happening. Now consider the leaf u which is farthest from r in the random experiment, and let w be an ancestor of u such that there are O(n 1/4 log n) edges between them. Since w will be closer to the root than all the leaves, it will be encountered before the leaves. But then a path of O(n 1/4 log n) edges will span Ω(n) leaves, and hence some edge will be stretched by at least Ω(n 3/4 ), which implies the lemma. If we see closely, the problem with this algorithm was that there was too much independence in the randomness used by this algorithm, causing the variance to be reduced and too many vertices were assigned a distance close to their mean. We will now see how to fix this. XV-3

4 19.3 An Algorithm that Works We will use the following lemma: Lemma 19.8 It is possible to color the edges of a rooted tree such that 1. Each color class lies within some root to leaf path. 2. Each root to leaf path has most log n colors. Proof. Let us sketch a proof: Let us start at the root r; if it has χ(r) children, then imagine χ(r) different painters, each with a different color walking down each edge (away from the root) painting the edge as they go. When a painter reaches the other end of an edge, which is a vertex v with χ(v) children, it creates χ(v) 1 new painters (with new distinct colors). It then goes down the edge to the subtree with the most leaves, and sends the new painters down the other χ(v) 1 edges. It is clear that each color class it contained within a root-leaf path. How many colors do we see on a root-leaf path; or equivalently, how many new colors were used? Let us consider a vertex v with child u, and a new painter was sent down the edge (v, u). But then we claim that the number of leaves in the subtree T u rooted at u is at most half the number in the subtree T v rooted at v. Indeed, if it were not, then T u would be the subtree with the most leaves and the same color would be used. Hence, a new color implies that the number of leaves halves, and hence the number of new colors is at most log(# of leaves) log n. It is not hard to see (by considering a complete binary tree) that this lemma is the best one can hope for The Algorithm We now present the final (and correct) algorithm: Algorithm 3: Consider the coloring of the tree satisfying the conditions in Lemma For each color class C, assign all the edges in C the same random number independently and uniformly from the range [1, 2]. Again, output the vertices in the order of their distance from the root. Before we begin, let ψ(v) be the random distance from r to the vertex v. Note that since ψ is 1-1 with probability 1, ψ uniquely defines the layout f that is the output of Algorithm 3: The tree-volume Tvol f(u) < f(v) ψ(u) < ψ(v). Let d G be the shortest path distance on the vertices V, and hence (V, d G ) is a metric. Given a set of vertices S V, let d S be the induced metric in S. Then (S, d S ) can be viewed as the complete graph with the edge (s 1, s 2 ) having weight d S (s 1, s 2 ). XV-4

5 Definition 19.9 Let T (S) denote the minimum spanning tree on (S, d S ). Define Tvol(S), the tree-volume of S, to be Tvol(S) = d S (e) The Roadmap e T (S) In this lecture, we only describe the road map for the proof that the algorithm has a competitive ratio of O(log 2.5 n). There will be four main conceptual steps: 1. We will show that the chance of a set falling into a unit interval is small. Formally, for any set S V, S = k, Pr[ψ(S) lies in some interval [i, i + 1)] ηk 1 Tvol(S) (19.1) The values of the parameter η we can prove will be specified later. 2. Call a set bad if it does not satisfy (19.1) above. By linearity of expectation, (19.1) implies that the expected number of bad sets can be bounded by E[ number of bad sets ] S =k η k 1 Tvol(S) (19.2) 3. Let D denote the local density lower bound. We will show that S =k 1 Tvol(S) n(d log n)k 1 (19.3) This allows us to relate the expected number of bad sets to the lower bound D. E[ number of bad sets ] n(η log n D) k 1 (19.4) By Markov s inequality, we get that with probability 1 2, number of bad sets 2 n(η log n D) k 1 (19.5) 4. Now suppose the bandwidth of the layout produced by Algorithm 3 is B. This implies that there is some edge (u, v) such that B 1 vertices x 1, x 2,..., x B 1 have ψ(u) < ψ(x 1 ) ψ(x 2 )... ψ(x B 1 ) ψ(v). (19.6) Since the length of the edge (u, v) is at most 2 (i.e., ψ(v) ψ(u) 2), at least half of the values ψ(x i ) must lie within some unit interval [i, i + 1). XV-5

6 However, this implies that there are at least ( B/2) k bad sets of size k. However, we know an upper bound (19.5) on the number of bad sets, and hence Setting k = log n and simplifying, we get that ( ) B/2 k 2n(η log nd) k 1 (19.7) k B/D n 1/k ηk log n η log 2 n (19.8) This same road-map will be used in subsequent classes to prove Theorem Note that, to complete the proof, we need to prove the facts in (19.2) (for some value of η) and (19.3). We sketch the main idea behind proving (19.2) with η = log n here; the Fact 19.3 is a fact about metrics that is independent of trees, and will be proved in a subsequent class Lower Bounds on Concentration of Variables We now describe the main ingredient which gives an intuition as to why the randomized Algorithm 3 does not suffer from the drawbacks present in Algorithm 2. Loosely, this is because the sum of log n well-spread-out random variables (which define ψ(v)) is not very closely concentrated around the mean. We will be interested in bounding the probability that if I = [i, i + 1) R 0 is a unit interval, then for any vertex v what is Pr[ψ(v) I]? Theorem (Leader and Radcliffe (1994)) Suppose d 1,..., d k chosen uniformly at random in [1, 2]. Then ] Pr[ di X i I 1 k i=1 d2 i k di. 1, and let X i be To see that this implies that Pr[ψ(v) I] log n d T (r, v) = η Tvol({r, v}, let the d i s be the lengths of the color classes on the v-root path. Since each length is chosen independently in [1, 2], i d ix i models the behavior of ψ(v), and shows that it is not too concentrated around the mean. This idea can be extended to show the Fact For details, read the paper of Gupta (2000) Littlewood-Offord type problems We will not prove Theorem here as well, but let us prove a simpler bound. XV-6

7 Theorem Suppose d 1,..., d k 1, and let Y i be chosen uniformly at random in [1, 2]. Then ] ( ) k Pr[ di Y i I 2 k 1 k/2 k. Proof. Consider the set of all { 1, +1} assignments to Y i such that Y i d i I. We can view this as a lattice, where an assignment A 1 is below another assignment A 2 if all the positions at which A 1 is +1 is a subset of those at which A 2 is +1. Note that since d i 1 for all i, the assignments for which Y i d i I will form an antichain in this lattice and hence their number cannot be more than ( k k/2). Since each assignment has probability 2 k the claim follows. References [Fei00] Uriel Feige. Approximating the bandwidth via volume respecting embeddings. Journal of Computer and System Sciences, 60(3): , Also in Proc. 30th STOC, 1998, pp [Gup00] Anupam Gupta. Improved bandwidth approximation for trees. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages , [LR94] Imre Leader and A. J. Radcliffe. Littlewood-Offord inequalities for random variables. SIAM Journal on Discrete Mathematics, 7(1):90 101, [Ung98] Walter Unger. The complexity of the approximation of the bandwidth problem. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 82 91, XV-7

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

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

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

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

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

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

### Discrete Applied Mathematics. The firefighter problem with more than one firefighter on trees

Discrete Applied Mathematics 161 (2013) 899 908 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The firefighter problem with

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

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

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

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

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

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

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

### Lecture 4 Online and streaming algorithms for clustering

CSE 291: Geometric algorithms Spring 2013 Lecture 4 Online and streaming algorithms for clustering 4.1 On-line k-clustering To the extent that clustering takes place in the brain, it happens in an on-line

### MATHEMATICAL ENGINEERING TECHNICAL REPORTS. An Improved Approximation Algorithm for the Traveling Tournament Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS An Improved Approximation Algorithm for the Traveling Tournament Problem Daisuke YAMAGUCHI, Shinji IMAHORI, Ryuhei MIYASHIRO, Tomomi MATSUI METR 2009 42 September

### Lecture 6 Online and streaming algorithms for clustering

CSE 291: Unsupervised learning Spring 2008 Lecture 6 Online and streaming algorithms for clustering 6.1 On-line k-clustering To the extent that clustering takes place in the brain, it happens in an on-line

### Linear Programming I

Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins

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

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

### Influences in low-degree polynomials

Influences in low-degree polynomials Artūrs Bačkurs December 12, 2012 1 Introduction In 3] it is conjectured that every bounded real polynomial has a highly influential variable The conjecture is known

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

### Online Bipartite Perfect Matching With Augmentations

Online Bipartite Perfect Matching With Augmentations Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, and Henry Lin Information Theory and Applications Center, U.C. San Diego Email: kamalika@soe.ucsd.edu

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

### 2.1 Complexity Classes

15-859(M): Randomized Algorithms Lecturer: Shuchi Chawla Topic: Complexity classes, Identity checking Date: September 15, 2004 Scribe: Andrew Gilpin 2.1 Complexity Classes In this lecture we will look

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

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

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

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

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

### SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

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

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### A o(n)-competitive Deterministic Algorithm for Online Matching on a Line

A o(n)-competitive Deterministic Algorithm for Online Matching on a Line Antonios Antoniadis 2, Neal Barcelo 1, Michael Nugent 1, Kirk Pruhs 1, and Michele Scquizzato 3 1 Department of Computer Science,

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

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

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

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

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

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

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

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

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

### The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,

The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpoints

### Distributed Computing over Communication Networks: Topology. (with an excursion to P2P)

Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs

Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs Artur Czumaj Asaf Shapira Christian Sohler Abstract We study graph properties which are testable for bounded degree graphs in time independent

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

### An Approximation Algorithm for the Unconstrained Traveling Tournament Problem

An Approximation Algorithm for the Unconstrained Traveling Tournament Problem Shinji Imahori 1, Tomomi Matsui 2, and Ryuhei Miyashiro 3 1 Graduate School of Engineering, Nagoya University, Furo-cho, Chikusa-ku,

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

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

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

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

### Embedding nearly-spanning bounded degree trees

Embedding nearly-spanning bounded degree trees Noga Alon Michael Krivelevich Benny Sudakov Abstract We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of

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

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

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

### Analysis of Algorithms I: Binary Search Trees

Analysis of Algorithms I: Binary Search Trees Xi Chen Columbia University Hash table: A data structure that maintains a subset of keys from a universe set U = {0, 1,..., p 1} and supports all three dictionary

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

### Online Prediction on Large Diameter Graphs

Online Prediction on Large Diameter Graphs Mark Herbster, Guy Lever, Massimiliano Pontil Department of Computer Science University College London Gower Street, London WCE 6BT, England, UK {m.herbster,

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

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

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

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

### The Online Set Cover Problem

The Online Set Cover Problem Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Seffi Naor ABSTRACT Let X = {, 2,..., n} be a ground set of n elements, and let S be a family of subsets of X, S

### UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs

### Cycle transversals in bounded degree graphs

Electronic Notes in Discrete Mathematics 35 (2009) 189 195 www.elsevier.com/locate/endm Cycle transversals in bounded degree graphs M. Groshaus a,2,3 P. Hell b,3 S. Klein c,1,3 L. T. Nogueira d,1,3 F.

### 1 The Brownian bridge construction

The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof

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

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Equilibrium computation: Part 1

Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium

### International Journal of Software and Web Sciences (IJSWS) www.iasir.net

International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

### P versus NP, and More

1 P versus NP, and More Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 If you have tried to solve a crossword puzzle, you know that it is much harder to solve it than to verify

### The LCA Problem Revisited

The LA Problem Revisited Michael A. Bender Martín Farach-olton SUNY Stony Brook Rutgers University May 16, 2000 Abstract We present a very simple algorithm for the Least ommon Ancestor problem. We thus

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

### Data Management in Hierarchical Bus Networks

Data Management in Hierarchical Bus Networks F. Meyer auf der Heide Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, Germany fmadh@upb.de H. Räcke Department

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

### Algorithms and Methods for Distributed Storage Networks 9 Analysis of DHT Christian Schindelhauer

Algorithms and Methods for 9 Analysis of DHT Institut für Informatik Wintersemester 2007/08 Distributed Hash-Table (DHT) Hash table does not work efficiently for inserting and deleting Distributed Hash-Table

### Load Balancing and Switch Scheduling

EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load

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

### The Cost of Offline Binary Search Tree Algorithms and the Complexity of the Request Sequence

The Cost of Offline Binary Search Tree Algorithms and the Complexity of the Request Sequence Jussi Kujala, Tapio Elomaa Institute of Software Systems Tampere University of Technology P. O. Box 553, FI-33101

### Graph Classification and Easy Reliability Polynomials

Mathematical Assoc. of America American Mathematical Monthly 121:1 November 18, 2014 1:11 a.m. AMM.tex page 1 Graph Classification and Easy Reliability Polynomials Pablo Romero and Gerardo Rubino Abstract.

### Decentralized Utility-based Sensor Network Design

Decentralized Utility-based Sensor Network Design Narayanan Sadagopan and Bhaskar Krishnamachari University of Southern California, Los Angeles, CA 90089-0781, USA narayans@cs.usc.edu, bkrishna@usc.edu

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### Topology-based network security

Topology-based network security Tiit Pikma Supervised by Vitaly Skachek Research Seminar in Cryptography University of Tartu, Spring 2013 1 Introduction In both wired and wireless networks, there is the

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

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

### Clique coloring B 1 -EPG graphs

Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La

### Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles

Short Cycles make W-hard problems hard: FPT algorithms for W-hard Problems in Graphs with no short Cycles Venkatesh Raman and Saket Saurabh The Institute of Mathematical Sciences, Chennai 600 113. {vraman

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the