A Better Approximation Algorithm for Finding Planar Subgraphs

Journal of Algorithms

Volumn 27, Issue 2, 1998, Pages 269-302

  Cǎlinescu, Gruia ^a   Fernandes, Cristina G ^a   Finkler, Ulrich ^b   Karloff, Howard ^a  

^a Georgia Institute of Technology   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (19)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science," pp. 14-23, 1992.
2. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications," Macmillan, New York, 1976.
3. J. Cai, X. Han, and R. E. Tarjan, An O(m log n)-time algorithm for the maximal planar subgraph problem, SIAM J. Comput. 22 (1993), 1142-1162.
4. R. Cimikowski, An analysis of some heuristics for the maximum planar subgraph problem, in "Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 322-331, 1995.
5. T. Chiba, I. Nishioka, and I. Shirakawa, An algorithm of maximal planarization of graphs, in "Proceedings of the IEEE Symposium on Circuits and Systems," pp. 649-652, 1979.
6. N. Chiba and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1985), 210-223.
7. H. N. Djidjev, A linear algorithm for the maximal planar subgraph problem, in "Proceedings of the Fourth International Workshop on Algorithms and Data Structures (WADS '95)," pp. 369-380, 1995.
8. M. E. Dyer, L. R. Foulds, and A. M. Frieze, Analysis of heuristics for finding a maximum weight planar subgraph, European J. Oper. Res. 20 (1985), 102-114.
9. L. R. Foulds, "Graph Theory Applications," Springer-Verlag, New York, 1992.
10. H. N. Gabow and M. Stallmann, Efficient algorithms for graphic matroid intersection and parity, in "Automata, Language and Programming: 12th Colloq.," Lecture Notes in Computer Science, Vol. 194, pp. 210-220, 1985.
11. M. R. Garey and D. S. Johnson, "Computers and Intractability," Freeman, New York, 1979.
12. F. Harary, "Graph Theory," Addison-Wesley, Reading, MA, 1972.
13. W. Hsu, A linear time algorithm for finding maximal planar subgraphs, in "Proceedings of the Sixth Annual International Symposium on Algorithms and Computation (ISAAC95)," 1995.
14. M. Jünger and P. Mutzel, Maximum planar subgraph and nice embeddings: Practical layout tools, Algorithmica, to appear.
15. P. C. Liu and R. C. Geldmacher, On the deletion of nonplanar edges of a graph, in "Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing," pp. 727-738, 1977.
16. L. Lovász and M. D. Plummer, "Matching Theory," Elsevier, Amsterdam, 1986.
17. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991), 425-440.
18. C. H. Papadimitriou and M. Yannakakis, The traveling salesman problem with distances one and two, Math. Oper. Res. 18(1) (1993), 1-11.
19. R. Tamassia, G. Di Battista, and C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. Systems Man Cybernet. 18 (1988), 61-79.