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
Proceedings ArticleDOI
Slotted Scheduled Tag Access in Multi-Reader RFID Systems
TL;DR: This paper develops centralized algorithms in a slotted time model to read all the tags using near-optimal number of time slots for slotted scheduled access of RFID tags in a multiple reader environment and significantly outperform colorwave, an existing algorithm for similar problems.
Book ChapterDOI
Efficient approximation schemes for geometric problems
TL;DR: It is shown that Maximum Independent Set is W[1]-complete for the intersection graphs of unit disks and axis-parallel unit squares in the plane and that the time PTAS of Hunt et al.
Journal ArticleDOI
Algorithmic, geometric and graphs issues in wireless networks
TL;DR: An overview of the recent progress of applying computational geometry techniques to solve some questions, such as topology construction and broadcasting, in wireless ad hoc networks is presented.
Journal ArticleDOI
Discrete Mobile Centers
TL;DR: A new randomized algorithm for maintaining a set of clusters among moving nodes in the plane that selects and maintains a variable subset of the nodes as cluster centers, which can enable numerous applications in ad hoc wireless networks, where mobile devices must be interconnected to perform various tasks collaboratively.
Proceedings ArticleDOI
Multiflows in multihop wireless networks
TL;DR: A rigorous proof of the NP-hardness of both problems even in very simple settings is provided and a unified framework for the design and analysis of polynomial approximation algorithms for both problems is developed.
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.