Lecture 3: 1 vs 3/4 + ɛ Hardness for Max-Coverage

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Advanced Approximation Algorithms (CMU B, Spring 2008) Lecture 3: 1 vs 3/4 + ɛ Hardness for Max-Coverage Jan 22, 2008 Lecturer: Ryan O Donnell Scribe: Ravishankar Krishnaswamy 1 Outline In this lecture, we prove that the 1 vs 3/4 + ɛ decision problem of MAX-COVERAGE is NP-Hard. The proof is a reduction from the MAX-LABEL-COVER problem. Just to recap, let us begin by defining the problem instance. The MAX-LABEL-COVER(K,L) Problem: An instance to the MAX-LABEL-COVER(K,L) problem comprises of a bipartite graph G(U, V, E) with U and V being the two partitions, and a projection function π v u : L K on each edge (u, v). The objective is to obtain a labeling of the vertices (a function f : U K, V L) which satisfies maximum fraction of the edges. Edge (u, v) is satisfied by labeling f if and only if f(u) = π v u (f(v)). Figure 1 describes such an instance. The following theorem has been proved by Raz. Theorem 1.1. [3] Given any constant η > 0, there exists a constant q = q(η) such that the 1 vs η decision problem for MAX-LABEL-COVER(K,L) is NP-Hard with K, L q. Moreover, the constant q is actually bounded by poly(1/η). Improved results on parallel repetition are proved by Holenstein [2] and Feige et al. [1]. Further, the hardness result holds (as we have seen in the first homework) even under the assumptions that G is left and right regular and U = V. We use this stronger result in our reduction to prove the soundness. Also, it is important to note that the size of the label sets K and L are bounded by a function which depends only on η. This means that for a fixed value of η, the sizes of K and L are at most a constant. We now reduce an instance G of MAX-LABEL-COVER(K,L) to an instance H of MAX- COVERAGE such that Opt(G) = 1 Opt(H) = 1 (Completeness) Opt(G) < η Opt(H) < 3/4 + ɛ (Soundness) where ɛ is a function of only η. We can see that once we prove completeness and soundness, we are through (by application of Theorem 1.1). Note that we have overloaded G to denote both the instance of the MAX-LABEL-COVER(K,L) problem, as well as the graph in the instance. 1

2 Figure 1: Max-Label-Cover Instance 2 The Reduction Given an instance of the MAX-LABEL-COVER(K,L) problem (we are given a bipartite graph G(U, V, E)), we create an instance H(E, S, m) of the MAX-COVERAGE problem, where E is the set of ground elements, S is the set system, and m is the number of sets we are allowed to pick. Henceforth, we let k and l denote the cardinality of sets K and L respectively. The Ground Elements: For each edge (u, v) E, introduce a block of 2 k ground elements (the elements from the set {0, 1} k ). Each element is therefore a boolean string of length k. For being able to distinguish between ground elements corresponding to different blocks, we refer to the ground elements from the block corresponding to edge (u, v) by the set {0, 1} k (u,v). Therefore, the total number of elements in E is 2 k E. Once again, note that for every element e E, we can associate a unique edge (u, v) to it. These elements are the diamonds in Figure 1. Notation 2.1. Given an element e {0, 1} k (u,v) and a label a K, define e a to be the bit corresponding the a th position of e. The Set System: For each u U, a K, we create a set S u,a that covers a subset of the elements which are associated with edges of the form (u, v ). Specifically, e {0, 1} k (u,v ) belongs to S u,a if and only if e a = 0. Similarly, for v V, α L, we create a set S v,α that covers a subset of the elements which are associated with edges of the form (u, v). Specifically, e {0, 1} k (u,v) belongs to S v,α if and only if e πv u (α) = 1. The number of sets we therefore create is k U + l V. 2

3 Covering Constraint: We also set the maximum number of sets that can be picked to be m = U + V. Because k and l are constants, it is easy to see that this reduction is poly-time. It is also worth noticing that the reduction is designed with the idea that whenever a consistent labeling exists for an edge (u, v), the whole block of ground elements {0, 1} k (u,v) can be covered by using just 2 sets (those corresponding to the satisfying labels). We now prove Completeness and Soundness of this reduction. Theorem 2.2. Completeness: Opt(G) = 1 Opt(H) = 1 Proof. Since Opt(G) = 1, there exists a function f : U K, V L s.t for each edge (u, v), f(u) = π v u (f(v)). Let us choose (as our m = U + V sets) a set corresponding to each vertex. In particular, let us choose the sets S u,f(u) for u U and S v,f(v) for v V. We show that these m sets cover all the ground elements. Let us focus on an edge (u, v). All the ground elements associated with this belong to the set {0, 1} k (u,v). By definition of the set system, the set S u,f(u) covers all the elements e {0, 1} k (u,v) with e f(u) = 0. Similarly, the set S v,f(v) covers all the elements e {0, 1} k (u,v) with e π v u (f(v)) = 1. However, since f is a consistent labeling on (u, v), we have f(u) = π v u (f(v)). Hence, S v,f(v) covers all the elements e {0, 1} k (u,v) with e f(u) = 1. Therefore, the above 2 sets covers the entire block. Applying this argument to each edge (u, v), we get the desired result. Theorem 2.3. Contrapositive of Soundness: Opt(H) 3/4 + ɛ Opt(G) ɛ 3 /2000 Before we prove this theorem, notice that the result stated above is actually the contrapositive of the original soundness claim that we had mentioned following Theorem 1.1. We will now show how proving this result would suffice. Given any fixed ɛ > 0 (it depends on how close to 3/4 we need the hardness result to be), we first set η = ɛ 3 /2000. Therefore, by Theorem 1.1, we can create an instance G of MAX-LABEL-COVER with a constant bound q on the cardinality of the sets K and L where the 1 vs η decision problem is hard. Also, recall that q depends only on η. We then reduce G to H using the reduction stated above. Now, if Opt(G) < η, it must be the case that Opt(H) < 3/4 + ɛ, because we have assumed that we know Theorem 2.3 to be true. This completes the proof of soundness. We now actually prove Theorem 2.3. Proof. Let Opt(H) > 3/4 + ɛ. Let S be a collection of m sets which achieves a coverage of more than 3/4 + ɛ. Our task now is to decode S into a reasonably good labeling for G. Idea: Firstly, the collection of sets can be partitioned according to which vertex each one is associated with. The idea is to essentially show that, if there is large element coverage, it must be the case that there exists a decent fraction of the edges for which the sets chosen contain two which correspond to a consistent labeling. Therefore, a random assignment of labels (from the sets that are in each vertex s partition) should hopefully lead to one which satisfies a non-negligible fraction of the edges. We formally prove along similar lines. 3

4 Definition 2.4. For vertex u U, set Suggest(u) to be the set {a K : S u,a S }. Likewise, for vertex v V, set Suggest(v) to be the set {α L : S v,α S }. We also overload the definition of Suggest for edges too by defining Suggest(u, v) to be Suggest(u) Suggest(v). Since we have picked m = U + V sets, we expect on an average Suggest(u, v) to be 2 for edge (u, v). We show this in the following lemma. Lemma 2.5. E (u,v) [ Suggest(u, v) ] = 2 Proof. E [ Suggest(u, v) ] (u,v) = E [ Suggest(v) ] (u,v) (u,v) (1) = E[ Suggest(u) ] + E[ Suggest(v) ] u v (2) = ( u U Suggest(u))/ U + ( v V Suggest(v))/ V (3) = ( u U Suggest(u) + v V Suggest(v))/ U (4) = m/(m/2) (5) = 2 (6) Here, the jump from step 1 to step 2 follows because of the initial assumption we had made that G is left regular and right regular (we can pick a random vertex by picking a random edge as well). Similarly, the jump from step 3 to step 4 follows because U = V in G. We now use a probabilistic argument to show the existence of a good labeling, given m sets which achieve coverage more than 3/4 + ɛ. Random Decoding: If Suggest(u) for u U V, choose f(u) to be an element uniformly randomly picked from Suggest(u). If Suggest(u) =, pick f(u) arbitrarily. We now need to show that E f [Coverage G (f)] ɛ 3 /2000. Once we show this, we know by using a probabilistic argument that there exists at least one such labeling f which also achieves a coverage of at least ɛ 3 /2000, thereby establishing that Opt(G) ɛ 3 /2000. Before we get to proving it, here are some preliminaries. Definition 2.6. An edge (u, v) is said to have consistent suggestions if there exist a Suggest(u) and α Suggest(v) such that a = π v u (α). Claim 2.7. Suppose (u, v) doesn t have consistent suggestions. Then, coverage of S on {0, 1} k (u,v) is at most 1 2 t where t = Suggest(u, v). Proof. Let Suggest(u) = {κ 1, κ 2,..., κ c }, and Suggest(v) = {λ 1, λ 2,..., λ d }. Also let t = c + d. For convenience, let us denote π v u : L K as just π. 4

5 An element e {0, 1} k (u,v) is covered if and only if e κ1 = 0 (or) e κ2 = 0 (or). e κc = 0 (or) e π(λ1 ) = 1 (or) e π(λ2 ) = 1 (or) e π(λd ) = 1. Note that some π(λ i ) may be the same as π(λ i ), but what we are guaranteed is that none of the elements π(λ i ) is equal to any term κ j (else (u, v) would have consistent suggestions). Let t = c+d be the number of distinct indices that appear in the above equations. We are now interested in the fraction of the elements (these would be the elements not covered by the two sets) which have constraints on all of those t distinct indices. This is exactly equal to 2 t which is at least 2 t. Hence the fraction of elements covered is at most 1 2 t, hence proving the claim. Remark 2.8. On an average t is 2 (Lemma 2.5). This gives us the 3/4 which we were looking for! To gather some intuition, we first prove the expectation result assuming Suggest(u, v) = 2 for each (u, v) E. By claim 2.7, S covers at most 3/4 fraction of the blocks on all inconsistent edges. However, the total coverage of S is at least 3/4 + ɛ, which means that there exists Ω(ɛ) fraction of the edges that have consistent suggestions. Also, if an edge (u, v) has consistent suggestions, it has to be the case that it has one labeling each from Suggest(u) and Suggest(v) (as Suggest(u, v) = 2, by assumption). Hence, the only possible assignment for f would satisfy the edge. This proves that the expected fraction of edges satisfied is non-negligible (Ω(ɛ)). Now, we move on to the actual proof, by first proving the following concavity lemma. Lemma 2.9. If t = t 1 + t t r, the values of t i maximizing ( i (1 2 t i ))/r are t i = t/r. Proof. Maximizing ( i (1 2 t i ))/r is equivalent to minimizing (1/r) i 2 t i. This quantity is at least 2 t/r (AM GM). Further, setting t i = t/r achieves this lower bound, thus proving the lemma. It is worth noting that if t suggestions are to be distributed to r edges, the above lemma proves that the optimal way to distribute them in order to maximize coverage is by giving each edge the average suggestions per edge (t/r). Definition Define an edge (u, v) to be frugally suggested if Suggest(u, v) 10/ɛ. Also, define an edge to be good if it is both frugally suggested and consistently suggested. 5

6 Suppose the fraction of good edges (u, v) is at least ɛ/20. We argue that this implies E f [Coverage G (f)] ɛ 3 /2000. Suppose (u, v) is good, it has consistent suggestions and hence there exist a Suggest(u) and α Suggest(v) such that the labeling (a, α) satisfies the edge (u, v). Further, since (u, v) is good, it is frugally suggested, so both Suggest(u) and Suggest(v) are at most 10/ɛ. Thus when f is randomly chosen, there is at least an (ɛ/10) 2 chance that it will get both f(u) = a and f(v) = α, thus satisfying (u, v). Hence in expectation, f satisfies at least an (ɛ/20)(ɛ/10) 2 = η fraction of edges (u, v), as desired. We now show that the fraction of good edges is at least ɛ/20. We assume the contrary. Then, for a randomly chosen edge (u, v), P[(u, v) has consistent suggestions] P[(u, v) is good] + P[(u, v) is not frugally suggested] < ɛ/20 + P[(u, v) has at least 10/ɛ suggestions] = ɛ/4 ɛ/20 + (2ɛ)/10 Here, P[(u, v) has at least 10/ɛ suggestions] is at most (2ɛ)/10 by Markov s inequality. This implies that the contribution of consistent edges to the Coverage is at most ɛ/4. Therefore, the average coverage on inconsistently suggested edges needs to be at least 3/4 + (3/4)ɛ. Further, the average number of labels per inconsistently suggested edge is at most 2/(1 ɛ/4) 2 + ɛ (as there are at least (1 ɛ/4) fraction of inconsistently suggested edges). Therefore, by applying the concavity lemma (Lemma 2.9), the coverage on inconsistently suggested edges is at most 1 2 (2+ɛ) = (1 (1/4)2 ɛ ) 1 1/4(1 ɛ ln 2). This quantity is at most 3/ ɛ which is strictly lesser than 3/4 + 3/4ɛ. This is a contradiction! This results in the following theorem, which was the objective of this lecture. Theorem Given any constant ɛ > 0, the 1 vs 3/4 + ɛ decision problem of MAX-COVERAGE is NP-Hard. References [1] U. Feige and J. Kilian. Two-prover protocols low error at affordable rates. SIAM Journal on Computing, 30(1): , Feb [2] T. Holenstein. Parallel repetition: simplifications and the no-signaling case. In STOC 07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages , New York, NY, USA, ACM. [3] R. Raz. A parallel repetition theorem. SIAM J. Comput., 27(3): ,

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

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

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

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

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

Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

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,

Notes 11: List Decoding Folded Reed-Solomon Codes

Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded Reed-Solomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,

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

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

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

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

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

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

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

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

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

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 }

Maximum Hitting Time for Random Walks on Graphs. Graham Brightwell, Cambridge University Peter Winkler*, Emory University

Maximum Hitting Time for Random Walks on Graphs Graham Brightwell, Cambridge University Peter Winkler*, Emory University Abstract. For x and y vertices of a connected graph G, let T G (x, y denote the

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

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

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.

Lecture 5 - CPA security, Pseudorandom functions

Lecture 5 - CPA security, Pseudorandom functions Boaz Barak October 2, 2007 Reading Pages 82 93 and 221 225 of KL (sections 3.5, 3.6.1, 3.6.2 and 6.5). See also Goldreich (Vol I) for proof of PRF construction.

Victor Shoup Avi Rubin. fshoup,rubing@bellcore.com. Abstract

Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin Bellcore, 445 South St., Morristown, NJ 07960 fshoup,rubing@bellcore.com Abstract In this paper, we investigate a method by which smart

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets Nathaniel Hendren January, 2014 Abstract Both Akerlof (1970) and Rothschild and Stiglitz (1976) show that

(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

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

The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

Network Algorithms for Homeland Security

Network Algorithms for Homeland Security Mark Goldberg and Malik Magdon-Ismail Rensselaer Polytechnic Institute September 27, 2004. Collaborators J. Baumes, M. Krishmamoorthy, N. Preston, W. Wallace. Partially

Lecture 11: The Goldreich-Levin Theorem

COM S 687 Introduction to Cryptography September 28, 2006 Lecture 11: The Goldreich-Levin Theorem Instructor: Rafael Pass Scribe: Krishnaprasad Vikram Hard-Core Bits Definition: A predicate b : {0, 1}

Lecture 2: Complexity Theory Review and Interactive Proofs

600.641 Special Topics in Theoretical Cryptography January 23, 2007 Lecture 2: Complexity Theory Review and Interactive Proofs Instructor: Susan Hohenberger Scribe: Karyn Benson 1 Introduction to Cryptography

Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

Codes for Network Switches

Codes for Network Switches Zhiying Wang, Omer Shaked, Yuval Cassuto, and Jehoshua Bruck Electrical Engineering Department, California Institute of Technology, Pasadena, CA 91125, USA Electrical Engineering

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

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,

CSC 373: Algorithm Design and Analysis Lecture 16

CSC 373: Algorithm Design and Analysis Lecture 16 Allan Borodin February 25, 2013 Some materials are from Stephen Cook s IIT talk and Keven Wayne s slides. 1 / 17 Announcements and Outline Announcements

Permutation Betting Markets: Singleton Betting with Extra Information

Permutation Betting Markets: Singleton Betting with Extra Information Mohammad Ghodsi Sharif University of Technology ghodsi@sharif.edu Hamid Mahini Sharif University of Technology mahini@ce.sharif.edu

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

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

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

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

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

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.

Lecture 10: CPA Encryption, MACs, Hash Functions. 2 Recap of last lecture - PRGs for one time pads

CS 7880 Graduate Cryptography October 15, 2015 Lecture 10: CPA Encryption, MACs, Hash Functions Lecturer: Daniel Wichs Scribe: Matthew Dippel 1 Topic Covered Chosen plaintext attack model of security MACs

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

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

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

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

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

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

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

Lecture 2: August 29. Linear Programming (part I)

10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.

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

each college c i C has a capacity q i - the maximum number of students it will admit

n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i - the maximum number of students it will admit each college c i has a strict order i

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

A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

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

Determination of the normalization level of database schemas through equivalence classes of attributes

Computer Science Journal of Moldova, vol.17, no.2(50), 2009 Determination of the normalization level of database schemas through equivalence classes of attributes Cotelea Vitalie Abstract In this paper,

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

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

! 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

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING 1. Introduction The Black-Scholes theory, which is the main subject of this course and its sequel, is based on the Efficient Market Hypothesis, that arbitrages

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

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

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

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

1 Formulating The Low Degree Testing Problem

6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,

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

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

Max Flow, Min Cut, and Matchings (Solution)

Max Flow, Min Cut, and Matchings (Solution) 1. The figure below shows a flow network on which an s-t flow is shown. The capacity of each edge appears as a label next to the edge, and the numbers in boxes

School Timetabling in Theory and Practice

School Timetabling in Theory and Practice Irving van Heuven van Staereling VU University, Amsterdam Faculty of Sciences December 24, 2012 Preface At almost every secondary school and university, some

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

Lecture 4: BK inequality 27th August and 6th September, 2007

CSL866: Percolation and Random Graphs IIT Delhi Amitabha Bagchi Scribe: Arindam Pal Lecture 4: BK inequality 27th August and 6th September, 2007 4. Preliminaries The FKG inequality allows us to lower bound

CPC/CPA Hybrid Bidding in a Second Price Auction

CPC/CPA Hybrid Bidding in a Second Price Auction Benjamin Edelman Hoan Soo Lee Working Paper 09-074 Copyright 2008 by Benjamin Edelman and Hoan Soo Lee Working papers are in draft form. This working paper

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

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

The Student-Project Allocation Problem

The Student-Project Allocation Problem David J. Abraham, Robert W. Irving, and David F. Manlove Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, UK Email: {dabraham,rwi,davidm}@dcs.gla.ac.uk.

Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

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

OHJ-2306 Introduction to Theoretical Computer Science, Fall 2012 8.11.2012

276 The P vs. NP problem is a major unsolved problem in computer science It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a \$ 1,000,000 prize for the

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

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)

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

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

The Complexity of Approximating a Nonlinear Program

The Complexity of Approximating a Nonlinear Program Mihir Bellare Phillip Rogaway October 1993 Abstract We consider the problem of finding the maximum of a multivariate polynomial inside a convex polytope.

Economics of Insurance

Economics of Insurance In this last lecture, we cover most topics of Economics of Information within a single application. Through this, you will see how the differential informational assumptions allow

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

Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances

Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances Jialin Zhang Tsinghua University zhanggl02@mails.tsinghua.edu.cn Wei Chen Microsoft Research Asia weic@microsoft.com Abstract

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

Section 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations

Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate

Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

MATHEMATICAL ENGINEERING TECHNICAL REPORTS. The Independent Even Factor Problem

MATHEMATICAL ENGINEERING TECHNICAL REPORTS The Independent Even Factor Problem Satoru IWATA and Kenjiro TAKAZAWA METR 2006 24 April 2006 DEPARTMENT OF MATHEMATICAL INFORMATICS GRADUATE SCHOOL OF INFORMATION

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

Online Scheduling for Cloud Computing and Different Service Levels

2012 IEEE 201226th IEEE International 26th International Parallel Parallel and Distributed and Distributed Processing Processing Symposium Symposium Workshops Workshops & PhD Forum Online Scheduling for

An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

This is the Pre-Published Version. An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines Q.Q. Nong, T.C.E. Cheng, C.T. Ng Department of Mathematics, Ocean

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