Approximation Algorithms for Independent Sets in Map Graphs

Journal of Algorithms

Volumn 41, Issue 1, 2001, Pages 20-40

  Chen, Zhi Zhong ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Independent set; Map graph; NP hardness; Planar graph

Indexed keywords

EID: 0346251621     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1178     Document Type: Article

References (19)

1. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach. 41 (1994), 153-180.
2. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber, A unified approach to approximating resource allocation and scheduling, in "Proceedings, 32th ACM Sympos. on Theory of Computing, 2000," pp. 735-744.
3. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Math. 25 (1985), 27-46.
4. H. L. Bodlaender, "Planar Graphs with Bounded Treewidth," Technical Report RUU-CS-88-14, Department of Computer Science, University of Utrecht, 1988.
5. H. L. Bodlaender, NC-algorithms for graphs with small treewidth, in "Proceedings, 14th International Workshop on Graph-Theoretic Concepts in Computer Science," Lecture Notes in Computer Science, Vol. 344, pp. 1-10, Springer-verlag, Berlin/New York, 1989.
6. H. L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996), 1305-1317.
7. O. V. Borodin, Cyclic coloring of plane graphs, Discrete Math. 100 (1992), 281-289.
8. 5-free graphs, J. Algorithms 26 (1998), 166-187.
9. ∼chen/papers/mg2.ps.gz for a full version.
10. J. Hȧstad, Clique is hard to approximate within n1-ε, in "Proceedings, 37th IEEE Symposium on Foundations of Computer Science, 1996," pp. 627-636.
11. R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177-189.
12. R. J. Lipton and R. E. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980), 615-627.
13. G. L. Miller, Finding small simple cycle separators for 2-connected planar graphs, J. Comput. System Sci. 32 (1986), 265-279.
14. T. Nishizeki and N. Chiba. "Planar Graphs: Theory and Algorithms," North-Holland, Amsterdam, 1988.
15. O. Ore and M. D. Plummer, Cyclic coloration of plane graphs, in "Recent Progress in Combinatorics," pp. 287-293, Academic Press, San Diego, 1969.
16. N. Robertson and P. Seymour, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986), 309-322.
17. J. A. Telle and A. Proskurowski, Practical algorithms on partial k-trees with an application to domination-like problems, in "Proceedings, 3rd Workshop on Algorithms and Data Structures," Lecture Notes in Computer Science, Vol. 709, pp. 610-621, Springer-Verlag, Berlin/New York, 1993.
18. M. Thorup, Map graphs in polynomial time, in "Proceedings, 39th IEEE Symposium on Foundations of Computer Science, 1998," pp. 396-405.
19. M. Thorup, personal communication, 1998.