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
Posted Content
Bidimensionality and Geometric Graphs
TL;DR: It is proved that Feedback Vertex Set on unit-ball graphs in R^3 neither admits PTASs unless P=NP, nor subexponential time algorithms unless the Exponential Time Hypothesis fails, and that the decomposition theorems which the approach is based on fail for disk graphs and that therefore any extension of the results to disk graphs would require new algorithmic ideas.
Journal ArticleDOI
PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms
TL;DR: This paper proposes PPS, a Privacy Preserving Strategyproof spectrum auction framework, and designs two schemes based on PPS separately for the single-unit auction model and the multi- unit auction model.
Optimization and approximation on systems of geometric objects
TL;DR: In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website as mentioned in this paper, in case of legitimate complaints the material will be removed.
Book ChapterDOI
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
Thomas Erlebach,Matúš Mihalák +1 more
TL;DR: This paper presents a (4+e)-approximation algorithm for the problem of computing a minimum-weight dominating set in unit disk graphs, where e is an arbitrarily small constant and the previous best known approximation ratio was 5+e.
DissertationDOI
The price of locality: Exploring the complexity of distributed coordination primitives
TL;DR: This thesis considers the complexity of different important distributed coordination tasks and establishes nearly tight upper and lower bounds on the possible trade-offs between running time and quality of the solution for a class of problems called covering and packing problems.
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.