A better approximation algorithm for finding planar subgraphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 16-25

  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

COMPUTATIONAL COMPLEXITY; DRAWING (GRAPHICS); POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

FACILITY LAYOUT; GRAPH DRAWING; MAX SNP-HARD; MAXIMUM PLANAR SUBGRAPH; PERFORMANCE RATIO; PLANAR SUBGRAPHS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SPANNING TREE;

APPROXIMATION ALGORITHMS;

EID: 84867468810     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. rd IEEE Symposium on Foundations of Computer Science, 14-23, 1992.
2. J. Cai, X. Han and R. E. Tarjan, "An O(m log retime Algorithm for the Maximal Planar Subgraph Problem," SIAM Journal on Computing, 22:1142-1162, 1993.
3. th Annual ACM-SIAM Symp. on Discrete Algorithms, 322-331, 1995.
4. T. Chiba, I. Nishioka and I. Shirakawa. "An Algorithm of Maximal Planarization of Graphs," Proc. IEEE Symp. on Circuits and Systems, 649-652, 1979.
5. N. Chiba and T. Nishizeki, "Arboricity and Subgraph Listing Algorithms," SIAM Journal of Computing, 14:210-223, 1985.
6. th International Workshop on Algorithms and Data Structures (WADS '95), 369-380, 1995.
7. M. E. Dyer, L. R. Foulds and A. M. Frieze, "Analysis of Heuristics for Finding a Maximum Weight Planar Subgraph," European Journal of Operational Research, 20:102-114, 1985.
8. L. R. Foulds, Graph Theory Applications, Springer-Verlag, New York, 1992.
9. th Colloq., Lecture Notes in Computer Science, Vol. 194, 210-220, 1985.
10. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Co., 1979.
11. F. Harary, Graph Theory, Addison-Wesley Publishing Company, 1972.
12. th Annual International Symposium on Algorithms and Computation (ISAAC95), 1995.
13. M. Jünger and P. Mutzel, "Maximum Planar Subgraph and Nice Embeddings: Practical Layout Tools," Universität zu Köln, Report No. 93.145, 1993, to appear in Special Issue of Algorithmica on Graph Drawing.
14. th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 727-738, 1977.
15. L. Lovász and M. D. Plummer, Matching Theory, Elsevier Science, Amsterdam, 1986.
16. C. H. Papadimitriou and M. Yannakakis. "Optimization, Approximation, and Complexity Classes," Journal of Computer and System Sciences, 43:425-440, 1991.
17. C. H. Papadimitriou and M. Yannakakis, "The Traveling Salesman Problem with Distances One and Two," Mathematics of Operations Research, 18(1):1-11, 1993.
18. R. Tamassia, G. Di Battista and C. Batini, "Automatic Graph Drawing and Readability of Diagrams," IEEE Transactions on Systems, Man and Cybernetics, 18:61-79, 1988.