Results 1  10
of
37
The algorithmic aspects of the Regularity Lemma
 J. Algorithms
, 1994
"... The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic. Here we first demonstrate the computational difficulty of finding a regular partition; we show that ..."
Abstract

Cited by 113 (30 self)
 Add to MetaCart
(Show Context)
The Regularity Lemma of Szemerédi is a result that asserts that every graph can be partitioned in a certain regular way. This result has numerous applications, but its known proof is not algorithmic. Here we first demonstrate the computational difficulty of finding a regular partition; we show that deciding if a given partition of an input graph satisfies the properties guaranteed by the lemma is coNPcomplete. However, we also prove that despite this difficulty the lemma can be made constructive; we show how to obtain, for any input graph, a partition with the properties guaranteed by the lemma, efficiently. The desired partition, for an nvertex graph, can be found in time O(M(n)), where M(n) = O(n 2.376) is the time needed to multiply two n by n matrices with 0, 1entries over the integers. The algorithm can be parallelized and implemented in NC 1. Besides the curious phenomenon of exhibiting a natural problem in which the search for a solution is easy whereas the decision if a given instance is a solution is difficult (if P and NP differ), our constructive version of the Regularity Lemma supplies efficient sequential and parallel algorithms for many problems, some of which are naturally motivated by the study of various graph embedding and graph coloring problems.
Approximating the Domatic Number
"... A set of vertices in a graph is a dominating set if every vertex outside the set has aneighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number ofvertices, ffi the minimum degree, and ..."
Abstract

Cited by 76 (7 self)
 Add to MetaCart
A set of vertices in a graph is a dominating set if every vertex outside the set has aneighbor in the set. The domatic number problem is that of partitioning the vertices of a graph into the maximum number of disjoint dominating sets. Let n denote the number ofvertices, ffi the minimum degree, and \Delta the maximum degree.We show that every graph has a domatic partition with (1o(1))(ffi + 1) / ln n dominatingsets, and moreover, that such a domatic partition can be found in polynomial time. This implies a (1 + o(1)) ln n approximation algorithm for domatic number, since the domaticnumber is always at most ffi + 1. We also show this to be essentially best possible. Namely,extending the approximation hardness of set cover by combining multiprover protocols with zeroknowledge techniques, we show that for every ffl> 0, a (1 ffl) ln napproximation impliesthat N P ` DT IM E(nO(log log n)). This makes domatic number the first natural maximization problem (known to the authors) that is provably approximable to within polylogarithmic factors but no better.We also show that every graph has a domatic partition with (1o(1))(ffi + 1) / ln \Delta dominating sets, where the &quot; o(1) &quot; term goes to zero as \Delta increases. This can be turned intoan efficient algorithm that produces a domatic partition of \Omega ( ffi / ln \Delta) sets.
Further Algorithmic Aspects of the Local Lemma
, 2001
"... We provide a method to produce an efficient algorithm to find an object whose existence is guaranteed by the Lov'asz Local Lemma. We feel that this method will apply to the vast majority of applications of the Local Lemma, unless the application has one of four problematic traits. However, pr ..."
Abstract

Cited by 41 (6 self)
 Add to MetaCart
(Show Context)
We provide a method to produce an efficient algorithm to find an object whose existence is guaranteed by the Lov'asz Local Lemma. We feel that this method will apply to the vast majority of applications of the Local Lemma, unless the application has one of four problematic traits. However, proving that the method applies to a particular application may require proving two (possibly difficult) concentrationlike properties.
An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
 In Proceedings of the 7th Annual ACMSIAM Symposium on Discrete Algorithms
, 1996
"... The Lov'asz Local Lemma (LLL) is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events, each of which asserts that a random variable does not deviate much from it ..."
Abstract

Cited by 38 (7 self)
 Add to MetaCart
(Show Context)
The Lov'asz Local Lemma (LLL) is a powerful tool in proving the existence of rare events. We present an extension of this lemma, which works well when the event to be shown to exist is a conjunction of individual events, each of which asserts that a random variable does not deviate much from its mean. We consider three classes of NPhard integer programs: minimax, packing, and covering integer programs. A key technique, randomized rounding of linear relaxations, was developed by Raghavan & Thompson to derive good approximation algorithms for such problems. We use our extended LLL to prove that randomized rounding produces, with nonzero probability, much better feasible solutions than known before, if the constraint matrices of these integer programs are sparse (e.g., VLSI routing using short paths, problems on hypergraphs with small dimension/degree). We also generalize the method of pessimistic estimators due to Raghavan, to constructivize our packing and covering results. 1
Acyclic edge colorings of graphs
 Journal of Graph Theory
, 2001
"... Abstract: A proper coloring of the edges of a graph G is called acyclic if there is no 2colored cycle in G. The acyclic edge chromatic number of G, denoted by a 0 (G), is the least number of colors in an acyclic edge coloring of G. For certain graphs G, a 0 (G) D(G) ‡ 2 where D(G) is the maximum d ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
(Show Context)
Abstract: A proper coloring of the edges of a graph G is called acyclic if there is no 2colored cycle in G. The acyclic edge chromatic number of G, denoted by a 0 (G), is the least number of colors in an acyclic edge coloring of G. For certain graphs G, a 0 (G) D(G) ‡ 2 where D(G) is the maximum degree in G. It is known that a 0 (G) 16 D(G) for any graph G. We prove that ÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐÐ
New Algorithmic Aspects Of The Local Lemma With Applications To Routing And Partitioning
"... . The Lov'asz Local Lemma (LLL) is a powerful tool that is increasingly playing a valuable role in computer science. The original lemma was nonconstructive; a breakthrough of Beck and its generalizations (due to Alon and Molloy & Reed) have led to constructive versions. However, these metho ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
. The Lov'asz Local Lemma (LLL) is a powerful tool that is increasingly playing a valuable role in computer science. The original lemma was nonconstructive; a breakthrough of Beck and its generalizations (due to Alon and Molloy & Reed) have led to constructive versions. However, these methods do not capture some classes of applications of the LLL. We make progress on this, by providing algorithmic approaches to two families of applications of the LLL. The first provides constructive versions of certain applications of an extension of the LLL (modeling, e.g., hypergraphpartitioning and lowcongestion routing problems); the second provides new algorithmic results on constructing disjoint paths in graphs. Our results can also be seen as constructive upper bounds on the integrality gap of certain packing problems. One common theme of our work is a "gradual rounding" approach.
Better approximation guarantees for jobshop scheduling
 SIAM Journal on Discrete Mathematics
, 1997
"... Abstract. Jobshop scheduling is a classical NPhard problem. Shmoys, Stein, and Wein presented the first polynomialtime approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further impro ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Jobshop scheduling is a classical NPhard problem. Shmoys, Stein, and Wein presented the first polynomialtime approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work and present further improvements for some important NPhard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). We also present NC algorithms with improved approximation guarantees for some NPhard special cases.
Optimal File Sharing in Distributed Networks
, 1991
"... The following le distribution problem is considered: Given a network of processors represented by an undirected graph G = (V; E), and a le size k, an arbitrary le w of k bits is to be distributed among all nodes of G. To this end, each node is assigned a memory device such that, by accessing the mem ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
The following le distribution problem is considered: Given a network of processors represented by an undirected graph G = (V; E), and a le size k, an arbitrary le w of k bits is to be distributed among all nodes of G. To this end, each node is assigned a memory device such that, by accessing the memory of its own and of its adjacent nodes, the node can reconstruct the contents of w. The objective is to minimize the total size of memory in the network. This paper presents a le distribution scheme which realizes this objective for k log G, where G stands for the maximum degree in G: For this range of k, the total memory size required by the suggested scheme approaches an integer programming lower bound on that size. The scheme is also constructive in the sense that, given G and k, the memory size at each node in G, as well as the mapping of any le w into the node memory devices, can be computed in time complexity which is polynomial in k and jV j. Furthermore, each node can reconstruct the contents of such a le w in O(k 2) bit operations. Finally, it is shown that the requirement of k being much larger than log G is necessary in order to have total memory size close to the integer programming lower bound.
Multicommodity flow and circuit switching
 Proceedings of the Hawaii International Conference on System Sciences
, 1998
"... ..."
(Show Context)