Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
Authors:
Open Access
- 28 September 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 62-71
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Topics in Intersection Graph Theory1999
- On Coloring Unit Disk GraphsAlgorithmica, 1998
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998
- Unit disk graph recognition is NP-hardComputational Geometry, 1998
- Simple heuristics for unit disk graphsNetworks, 1995
- An optimal algorithm for finding dominating cycles in circular-arc graphsDiscrete Applied Mathematics, 1992
- Unit disk graphsDiscrete Mathematics, 1990
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968