Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks

Proceedings of the Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2002, Pages 62-71

  Li, Xiang Yang ^a   Wang, Yu ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Disk graphs; Independent set; PTAS; Vertex coloring; Vertex cover; Wireless ad hoc networks

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER ARCHITECTURE; COMPUTER SCIENCE; GRAPH THEORY; HEURISTIC METHODS;

AD HOC NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036982592     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/570810.570819     Document Type: Conference Paper

References (14)

1. BREU, H., AND KIRKPATRICK, D. G. Unit disk graph recognition is NP-hard. Computational Geometry. Theory and Applications 9, 1-2 (1998), 3-24.
2. CLARK, B., COLBOURN, C., AND JOHNSON, D. Unit disk graphs. Discrete Mathematics 86 (1990), 165-177.
3. ERLEBACH, T., JANSEN, K., AND SEIDEL, E. Polynomial-time approximation schemes for geometric graphs. In Twelfth Annual Symposium on Discrete algorithms (2001).
4. GOLUMBIC, M. C. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York., 1980.
5. GRAF, A., STUMPF, M., AND WEISENFELS, G. On coloring unit disk graphs. Algorithmica 20, 3 (1998), 277-293.
6. HOCHBAUM, D. S. Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics 6 (1983), 243-254.
7. HOCHBAUM, D. S., AND MAASS, W. Approximation schemes for covering and packing problems in image processing and vlsi. Journal of ACM 32 (1985), 130-136.
8. HUNT, H., MARATHE, M. V., RADHAKRISHNAN, V., RAVI, S., ROSENKRANTZ, D. J., AND STEARNS, R. E. Nc-approximation schemes for np and pspace hard problems for geometric graphs. Journal of Algorithms 26 (1998), 238-274.
9. KEIL, J. M., AND SCHAEFER, D. An optimal algorithm for finding dominating cycles in circular-arc graphs. Discrete Applied Mathematics (1992), 25-34.
10. MARATHE, M. V., BREU, H., HUNT III, H. B., RAVI, S. S., AND ROSENKRANTZ, D. J. Simple heuristics for unit disk graphs. Networks 25 (1995), 59-68.
11. MCKEE, T. A., AND MCMORRIS, F. R. Topics in Intersection Graph Theory. Vol. 2 of Monographs on Discrete Mathematics and Applications, SIAM, 1999.
12. ROBERTS, F. Graph Theory and Its Applications to Problems of Society. SIAM Press, Philadelphia, PA., 1978.
13. SZEKERES, G., AND WILF, H. An inequality for the chromatic number of a graph. Journal of Combinatorial Theory 4 (1968), 1-3.
14. WILLIAM, T. P. Three-dimensional geometry and topology. The Geometry Center, University of Minnesota, Minneapolis, MN., 1991.