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 Article
Approximating minimum independent dominating sets in wireless networks.
Johann L. Hurink,Tim Nieberg +1 more
TL;DR: The approach presented yields a robust algorithm, that is, it accepts any undirected graph as input, and returns a (1+@e)-approximate minimum independent dominating set, or a certificate showing that the input graph does not satisfy the bounded growth property.
Approximation algorithms for graph problems
TL;DR: This thesis studies approximation algorithms for two fundamental problems arising in graph theory: counting copies of one graph in another graph and estimating distances in geometric graphs and presents algorithms for constructing approximate sparse representations of geometric intersection graphs.
Proceedings ArticleDOI
PTAS for sparse general-valued CSPs
TL;DR: In this article, a polynomial-time approximation scheme for constraint satisfaction problems (CSPs) such as Maximum Independent Set or Minimum Vertex Cover on sparse graph classes is presented.
Journal ArticleDOI
Algorithms for the minimum weight k-fold (connected) dominating set problem
Wenkai Ma,Deying Li,Zhao Zhang +2 more
TL;DR: Using slab decomposition and dynamic programming, two exact algorithms for the computation of MWkDS and MWkCDS are given which can be executed in polynomial time if the thickness of the graph is bounded above.
Proceedings ArticleDOI
A Decomposition Method for Transmission Scheduling in Multi-Channel Wireless Sensor Networks
TL;DR: This work considers wireless sensor networks with multiple frequency channels, multiple gateways and multiple classes of traffic carrying data generated by different sensory inputs and proposes a decomposition algorithm drawing upon large-scale decomposition ideas in mathematical programming.
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.