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
Estimation of Packet Loss Rate at Wireless Link of VANET--RPLE
TL;DR: This paper proposes an estimation algorithm for packet loss on VANET, RPLE (Real time packet loss estimation), which uses few probe packets and enhance the estimation accuracy than traditional methods for packets loss on wireless networks.
Journal ArticleDOI
Impact of Locality on Location Aware Unit Disk Graphs
Andreas Wiese,Evangelos Kranakis +1 more
TL;DR: This work proposes local constant ratio approximation algorithms for solving minimum dominating and connected dominating set, maximum independent set and minimum vertex cover in location aware Unit Disk Graphs and proves the first ever lower bounds for local algorithms for these problems with a given locality in the location aware setting.
Journal ArticleDOI
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
TL;DR: The PTAS for problem (ii) enables one, in practical cases, to obtain a ([email protected])-approximation for minimum discrete piercing (i.e., for arbitrary P).
Book ChapterDOI
Polynomial kernels for hard problems on disk graphs
TL;DR: The intersection graphs of (unit) disks in the plane, which can be arbitrarily dense but do exhibit some geometric structure, are considered and it is proved that H-Matching on unit-disk graphs has a linear-vertex kernel for every fixed graph H.
Posted Content
Spanners for Geometric Intersection Graphs
TL;DR: In this paper, a (1 + ϵ)-spanner is constructed for a unit ball graph in R^k using efficient partitioning of the space into hypercubes and solving bichromatic closest pair 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.