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
Minimizing End-to-End Delay in Wireless Networks Using a Coordinated EDF Schedule
TL;DR: The extent to which results on the schedulability of packet deadlines can be carried over from the wireline to the wireless context is carried over and ways in which the theoretical schedulers considered can be transferred to a more practical random-access based setting are examined.
Journal ArticleDOI
Facility dispersion problems under capacity and cost constraints
TL;DR: This work considers different versions of this dispersion problem where each potential site has an associated storage capacity and a storage cost and presents results that bring out the intrinsic difficulty of obtaining near-optimal solutions to some versions.
Journal IssueDOI
Improper coloring of unit disk graphs
TL;DR: The main subject of this work is analyzing the complexity of computing χk for the class of unit disk graphs and some related classes, e.g., hexagonal graphs and interval graphs and shows NP-completeness in many restricted cases and also provides both positive and negative approximability results.
Patent
Technique for establishing a virtual backbone in an ad hoc wireless network
TL;DR: In this article, a leader election and tree construction phase constructs a tree of neighboring transceivers with one transceiver being designated the root and with each transceiver establishing and recording its location in the tree structure and the identifiers of its neighbors; and reporting when the tree is established.
Proceedings ArticleDOI
An Interference-Aware Channel Assignment Scheme for Wireless Mesh Networks
TL;DR: This paper investigates the problem of finding the largest number of links that can be activated simultaneously in a wireless mesh network subject to interference, radio and connectivity constraints and presents an interference aware channel assignment algorithm that produces near optimal solution.
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.