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
Polynomial time approximation schemes for minimum disk cover problems
Chen Liao,Shiyan Hu +1 more
TL;DR: This work presents the first polynomial time approximation scheme for the minimum disk cover problem where the best known algorithm can approximate the optimal solution with a large constant factor.
Proceedings ArticleDOI
A generic distributed broadcast scheme in ad hoc wireless networks
TL;DR: Simulation results show that new algorithms, which are more efficient than existing ones, can be derived from the generic framework and several existing broadcast algorithms can be viewed as special cases of thegeneric framework with k-hop neighborhood information.
Proceedings ArticleDOI
Extractors and Rank Extractors for Polynomial Sources
TL;DR: This paper constructs explicit deterministic extractors from polynomial sources, namely from distributions sampled by low degree multivariate polynomials over finite fields, and employs a theorem of Bombieri, giving a character sum estimate for polynmials defined over curves.
Proceedings Article
The Within-Strip Discrete Unit Disk Cover Problem.
TL;DR: It is proved that the Within-Strip Discrete Unit Disk Cover (WSDUDC) problem is NP-complete on strips of any xed height, which is the most interesting result from a theoretical standpoint.
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.