Journal ArticleDOI
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
Harry B. Hunt,Madhav V. Marathe,Venkatesh Radhakrishnan,S. S. Ravi,Daniel J. Rosenkrantz,Richard Edwin Stearns +5 more
Reads0
Chats0
TLDR
The approximation schemes for hierarchically specified unit disk graphs presented in this paper are among the first approximation schemes in the literature for natural PSPACE-hard optimization problems.About:
This article is published in Journal of Algorithms.The article was published on 1998-02-01. It has received 345 citations till now. The article focuses on the topics: Indifference graph & Chordal graph.read more
Citations
More filters
Journal ArticleDOI
Distributed heuristics for connected dominating sets in wireless ad hoc networks
TL;DR: Two destributed heuristics with constant performance ratios are proposed, which require only single-hop neighborhood knowledge, and a message length of O (1) and O(n log n), respectively.
Journal ArticleDOI
On the complexity of scheduling in wireless networks
TL;DR: This work considers the problem of throughput-optimal scheduling in wireless networks subject to interference constraints, and shows that a simple greedy algorithm can provide a 49-approximation, and the maximal matching scheduling policy achieves a guaranteed fraction of the capacity region for "all".
Journal ArticleDOI
Survey of local algorithms
TL;DR: This work surveys the state-of-the-art in the field of local algorithm design, covering impossibility results, deterministic local algorithms, randomized localgorithms, and local algorithms for geometric graphs.
Proceedings ArticleDOI
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory
Matthew Andrews,Michael Dinitz +1 more
TL;DR: It is shown that maximizing the number of supported connections is NP-hard, even when there is no background noise, in contrast to the problem of determining whether or not a given set of connections is feasible since that problem can be solved via linear programming.
Proceedings ArticleDOI
Initializing newly deployed ad hoc and sensor networks
TL;DR: This paper model the network as a multi-hop quasi unit disk graph and allows nodes to wake up asynchronously at any time, and shows that even for this restricted model, a good clustering can be computed efficiently.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.