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
Book ChapterDOI
Domination in geometric intersection graphs
TL;DR: It is shown that for intersection graphs of arbitrary fat objects, the dominating set problem is as hard to approximate as for general graphs, and a new general technique for deriving approximation algorithms for various geometric intersection graphs is presented.
Proceedings ArticleDOI
Reader Activation Scheduling in Multi-reader RFID Systems: A Study of General Case
TL;DR: This paper develops a centralized algorithm and proposes a novel algorithm which does not need any location information of the readers and extends the previous algorithm in distributed manner in order to suit the case where no central entity exists.
Independent and Dominating Sets in Wireless Communication Graphs
TL;DR: The design of an energy-efficient communication strategy for low-resource, large-scale wireless networks that is based on an integrated approach stemming over various layers of the communication stack and answers and contributes to several open questions from the literature.
Journal ArticleDOI
An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
TL;DR: This paper considers the minimum k-connected d-dominating set problem, which is a fault-tolerant generalization of the minimum connected dominating set (MCDS) problem, and a lazy-constraint approach is shown to compare favorably with existing approaches for the MCDS problem.
Journal ArticleDOI
On connected domination in unit ball graphs
TL;DR: It is shown that the problem is hard to approximate within a factor better than 2 in graphs whose edge weights satisfy the triangle inequality and provided a 3-approximation algorithm for such graphs.
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.