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
Mathematical Aspects of Network Routing Optimization
TL;DR: "Mathematical Aspects of Network Routing Optimization" provides a thorough introduction to the subject of algorithms for network routing, and focuses especially on multicast and wireless ad hoc systems.
Proceedings ArticleDOI
Smooth kinetic maintenance of clusters
TL;DR: A simple, deterministic kinetic data structure for maintaining a covering of moving points by axis-aligned unit boxes in Rd.
Book ChapterDOI
A PTAS for the Weighted Unit Disk Cover Problem
TL;DR: The first polynomial-time approximation scheme (PTAS) for WUDC is presented affirmatively and can be used to obtain the first PTAS for the maxmimum lifetime coverage problem and an improved constant approximation ratio for the connected dominating set problem in unit disk graphs.
Proceedings ArticleDOI
Complexity of scheduling with analog network coding
TL;DR: The complexity of scheduling wireless links in the physical interference model with analog network coding capability is analyzed and an instance of the scheduling problem in the geometric SINR model, in which nodes are distributed in the Euclidean plane is constructed.
Book ChapterDOI
Discrete Mathematics and Radio Channel Assignment
TL;DR: The following generalization of graph colouring arises naturally in the study of channel assignment for cellular radiocommunications networks.
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.