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 Geometric Intersection Graphs
TL;DR: These are the first known PTASs for $\mathcal{NP}$-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible.
Journal ArticleDOI
Optimal Link Scheduling for Age Minimization in Wireless Systems
TL;DR: This work investigates age minimization in a wireless network and proposes a novel approach of optimizing the scheduling strategy to deliver all messages as fresh as possible and proves it is NP-hard in general.
Journal ArticleDOI
Models and approximation algorithms for channel assignment in radio networks
TL;DR: Efficient approximation algorithms for the distance-2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks, including (r,s)-civilized graphs, planar graphs, graphs with bounded genus, etc.
Journal 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.
Journal ArticleDOI
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks
TL;DR: This work is the first attempt at characterizing an important "maximum" measure of wireless network capacity, and can be used to shed light on previous topology formation protocols like Span and GAF that attempt to produce "good" or "capacity-preserving" topologies, while allowing nodes to alternate between sleep and awake states.
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.