Approximation algorithms for unit disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 351-361

  Van Leeuwen, Erik Jan ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

DISK GRAPHS; FPTAS; MAXIMUM INDEPENDENT SET; THEORETIC PROBLEMS;

ALGORITHMS;

EID: 33744938201     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_31     Document Type: Conference Paper

References (23)

1. Alber, J., Fiala, J., "Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs", J. Algorithms 52 2 (Aug. 2003), pp. 134-151.
2. Alber, J., Niedermeier, R., "Improved Tree Decomposition Based Algorithms for Domination-like Problems" in LATIN 2002, LNCS 2286, Springer-Verlag, Berlin, 2002, pp. 613-628.
3. Ausiello, G., Creszenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M., Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability, Springer-Verlag, Berlin, 1999.
4. Baker, B.S., "Approximation Algorithms for NP-Complete Problems on Planar Graphs", JACM 41 1 (1994), pp. 153-180.
5. Becker, H.W. "Planar Rhyme Schemes", Bull. Am. Math. Soc. 58 (1952), pp. 39.
6. Bodlaender, H.L., "A Tourist Guide through Treewidth", Acta Cybernetica 11 1-2 (1993), pp. 1-22.
7. Chan, T.M., "Polynomial-time Approximation Schemes for Packing and Piercing Fat Objects", J. Algorithms 46 2 (Feb. 2003), pp. 178-189.
8. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z., "A Polynomial-Time Approximation Scheme for the Minimum Connected Dominating Set in Ad Hoc Wireless Networks", Networks 42 4 (Dec. 2003), pp. 202-208.
9. Clark, B.N., Colbourn, C.J., Johnson, D.S., "Unit Disk Graphs", Discr. Math. 86 1-3 (1990), pp. 165-177.
10. Demaine, E.D., Hajiaghayi, M., "Bidimensionality: New Connections between FPT Algorithms and PTASs" in SODA 2005, SIAM, 2005, pp. 590-601.
11. Downey, R.G., Fellows, M.R., Parameterized Complexity, Springer-Verlag, New York, 1999.
12. Erlebach, T., Jansen, K., Seidel, E., "Polynomial-time Approximation Schemes for Geometric Graphs" in SODA 2001, SIAM, 2001, pp. 671-679.
13. Hochbaum, D.S., Maass, W., "Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI", JACM 32 1 (1985), pp. 130-136.
14. Hunt III, D.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E., "NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs", J. Algorithms 26 2 (1998), pp. 238-274.
15. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J., "Simple Heuristics for Unit Disk Graphs", Networks 25 (1995), pp. 59-68.
16. Matsui, T., "Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs", in JCDCG, LNCS 1763, Springer-Verlag, Berlin, 1998, pp. 194-200.
17. Nieberg, T., Hurink, J.L., Kern, W., "A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs" in WG 2004, LNCS 3353, Springer-Verlag, Berlin, 2004, pp. 214-221.
18. Nieberg, T., Hurink, J.L., A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs, Memorandum No. 1732, Dept. of Appl. Math., Univ. Twente, Enschede, 2004.
19. Robertson, N., Seymour, P.D., "Graph Minors. I. Excluding a Forest", J. Comb. Th. B 35 (1983), pp. 39-61.
20. Telle, J.A., Proskurowski, A., "Algorithms for Vertex Partitioning Problems on Partial k-Trees", SIAM J. Disc. Math. 10 4 (1997), pp. 529-550.
21. van Leeuwen, E.J., Optimization Problems on Mobile Ad Hoc Networks - Algorithms for Disk Graphs, Master's Thesis INF/SCR-04-32, Inst. of Information and Computing Sciences, Utrecht Univ., 2004.
22. van Leeuwen, E.J., Approximation Algorithms for Unit Disk Graphs, Technical Report UU-CS-2004-066, Inst. of Information and Computing Sciences, Utrecht Univ., 2004.
23. Wan, P-J., Alzoubi, K.M., Frieder, O., "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks", IEEE Infocom 2002, Volume 3, 2002, pp. 1597-1604.