Results 1 
8 of
8
On Chromatic Sums and Distributed Resource Allocation
"... This paper studies an optimization problem that arises in the context of distributed resource allocation: Given a conflict graph that represents the competition of processors over resources, we seek an allocation under which no two jobs with conflicting requirements are executed simultaneously. Our ..."
Abstract

Cited by 66 (14 self)
 Add to MetaCart
This paper studies an optimization problem that arises in the context of distributed resource allocation: Given a conflict graph that represents the competition of processors over resources, we seek an allocation under which no two jobs with conflicting requirements are executed simultaneously. Our objective is to minimize the average response time of the system. In alternative formulation this is known as the Minimum Color Sum (MCS) problem [24]. We show, that the algorithm based on finding iteratively a maximum independent set (MaxIS) is a 4approximation to the MCS. This bound is tight to within a factor of 2. We give improved ratios for the classes of bipartite, boundeddegree, and line graphs. The bound generalizes to a 4aeapproximation of MCS for classes of graphs for which the maximum independent set problem can be approximated within a factor of ae. On the other hand, we show that an n1 \Gamma fflapproximation is NPhard, for some ffl? 0. For some instances of the resource allocation problem, such as the Dining Philosophers, an efficient solution requires edge coloring of the conflict graph. We introduce the Minimum Edge Color Sum (MECS) problem which is shown to be NPhard. We show that a 2approximation to MECS(G) can be obtained distributively using compact coloring within O(log² n) communication rounds.
Greed is Good: Approximating Independent Sets in Sparse and . . .
, 1994
"... ... for short, is one of the ~implest, most efficient, and most thoroughly studied methods for finding independent sets in graphs. We show that it surprisingly achieves a performance ratio of (A+ 2)/3 for approximating independent sets in graphs with degree bounded by A. The analysis directs us tow ..."
Abstract

Cited by 56 (7 self)
 Add to MetaCart
... for short, is one of the ~implest, most efficient, and most thoroughly studied methods for finding independent sets in graphs. We show that it surprisingly achieves a performance ratio of (A+ 2)/3 for approximating independent sets in graphs with degree bounded by A. The analysis directs us towards a simple parallel and distributed algorithm with identical performance, which on constantdegree graphs runs in O(log ” n) time using linear number of processors. We also analyze the Greedy algorithm when run in combination with a fractional relaxation technique of Nemhauser and Trotter, and obtain an improved (2Z + 3)/5 performance ratio on graphs with average degree ~. Finally, we introduce a generally applicable technique for improving the approximation ratios of independent set algorithms, and illustrate it by improving the performance ratio of Greedy for large ∆.
Approximating maximum independent sets in uniform hypergraphs
 In Proc. 23rd Intl. Symp
, 1998
"... We consider the problem of approximating the independence number and the chromatic number of kuniform hypergraphs on n vertices. For xed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log (k,1) n) 2). This extends results of Bo ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We consider the problem of approximating the independence number and the chromatic number of kuniform hypergraphs on n vertices. For xed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log (k,1) n) 2). This extends results of Boppana and Halldorsson [5] who showed for the graph case that an approximation ratio of O(n=(log n) 2) can be achieved in polynomial time. On the other hand, assuming NP 6 = ZPP, one cannot obtain in polynomial time for the independence number and the chromatic number of kuniform hypergraphs an approximation ratio of n 1, for xed>0. 1
The Algorithmic Aspects of Uncrowded Hypergraphs
 PROC. 8TH ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS SODA
, 1996
"... We consider the problem of finding deterministically a large independent set of guaranteed size in a hypergraph on n vertices and with m edges. With respect to the Tur'an bound, the quality of our solutions is for hypergraphs with not too many small cycles by a logarithmic factor in the input size b ..."
Abstract

Cited by 13 (12 self)
 Add to MetaCart
We consider the problem of finding deterministically a large independent set of guaranteed size in a hypergraph on n vertices and with m edges. With respect to the Tur'an bound, the quality of our solutions is for hypergraphs with not too many small cycles by a logarithmic factor in the input size better. The algorithms are fast; they often have a running time of O(m) + o(n³). Indeed, the denser the hypergraphs are the more close are the running times to the linear ones. This gives for the first time for some combinatorial problems algorithmic solutions with stateoftheart quality, solutions of which so far only the existence was known. In some cases, the corresponding upper bounds match the lower bounds up to constant factors. The involved concepts are uncrowded hypergraphs.
Finding Large Independent Sets of Hypergraphs in Parallel
"... A basic problem in hypergraphs is that of finding a large independent set–one of guaranteed size–in a given hypergraph. Understanding the parallel complexity of this and related independent set problems on hypergraphs is a fundamental open issue in parallel computation. Caro and Tuza (J. Graph Theor ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A basic problem in hypergraphs is that of finding a large independent set–one of guaranteed size–in a given hypergraph. Understanding the parallel complexity of this and related independent set problems on hypergraphs is a fundamental open issue in parallel computation. Caro and Tuza (J. Graph Theory, Vol. 15, pp. 99–107, 1991) have shown a certain lower bound αk(H) on the size of a maximum independent set in a given kuniform hypergraph H, and have also presented an efficient sequential algorithm to find an independent set of size αk(H). They also show that αk(H) is the size of the maximum independent set for various hypergraph families. Here, we develop the first RNC algorithm to find an independent set of size αk(H), and also derandomize it for various special cases. We also present lower bounds on independent set size and corresponding RNC algorithms for nonuniform hypergraphs.
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
"... Abstract. The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where V  = n. It is assumed that during execution of the communication task every node in V is all ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where V  = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires D + Ω ( √ n − D) transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in D + O ( √ n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n − D) 1/(2k) ) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn 1/(k−2) log 2 n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and a number of open problems in the area.
DOI 10.1007/s0044600800580 Time efficient kshot broadcasting in known topology radio networks
"... Abstract The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where V =n. It is assumed that during execution of the communication task every node in V is allowed ..."
Abstract
 Add to MetaCart
Abstract The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where V =n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires D + � ( √ n − D) transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in D + O ( √ n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + �((n − D) 1/(2k) ) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn1/(k−2) log2 n) rounds. The paper concludes with a number of open problems in the area.
Energy and Time Efficient Broadcasting in Known Topology Radio Networks
"... Abstract. The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V,E) where V  = n. It is assumed that during execution of the communication task every node in V is allo ..."
Abstract
 Add to MetaCart
Abstract. The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V,E) where V  = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires D + Ω ( √ n − D) transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in D + O ( √ n log n) rounds. Moreover, if we allow each node to transmit at most k times, the lower bound D + Ω((n − D) 1/(2k) ) on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in D + O(kn 1/(k−2) log 2 n) rounds. The paper concludes with a discussion of several other strategies for energy efficient radio broadcasting and a number of open problems in the area.