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 ChapterDOI
Approximation algorithms for geometric intersection graphs
TL;DR: The main ideas of the polynomial time approximation schemes for the maximum weight independent set problem in disk graphs and for themaximum bisection problem in unit-disk graphs are described.
Posted Content
Beyond Baker's Technique.
TL;DR: This paper proposes a unified framewo rk to formulate the optimization problems where the local constraints of these problems are encoded by functions attached on the vertices, and generalizes Baker’s technique and many existing methods of graph decomposition.
Journal ArticleDOI
Linear Programming Approximations for Index Coding
TL;DR: In this article, the problem of index coding over broadcast channels has been studied for graphs with small chromatic number and disk graphs, and several LP-based schemes for the general case have been proposed.
Algorithms for resource utilization in sensor networks
Budhaditya Deb,Badri Nath +1 more
TL;DR: This thesis proposes adaptive algorithms for both the data dissemination and the network management problems which exploit the fundamental tradeoffs between resource consumption and protocol performance and shifts the algorithm design paradigm from an unconstrained optimization problem to optimization under application constraints.
Journal Article
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum Weight Independent Set in Local Conflict Graphs
TL;DR: This work shows that two assumptions on the geometric structure of conflict graphs suffice to achieve polynomial-time constant-factor approximations to solve the algorithmic problem of coordinating transmissions in a wireless network where radio interference constrains concurrent transmissions on wireless links.
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.