Improved approximations of crossings in graph drawings and VLSI layout areas

SIAM Journal on Computing

Volumn 32, Issue 1, 2003, Pages 231-252

  Even, Guy ^a   Guha, Sudipto ^b   Schieber, Baruch ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithm; Crossing number; Graph drawing; VLSI layout

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIFURCATION (MATHEMATICS); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; INTEGRATED CIRCUIT LAYOUT; THEOREM PROVING; VLSI CIRCUITS;

APPROXIMATION ALGORITHM; CROSSING NUMBER; GRAPH DRAWINGS; LOGARITHMIC FACTOR;

GRAPH THEORY;

EID: 0037604845     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700373520     Document Type: Article

References (15)

1. S. N. Bhatt and F. T. Leighton, A framework for solving VLSI graph layout problems, J. Comput. System Sci., 28 (1984), pp. 300-343.
2. G. Even, J. Naor, S. Rao, and B. Schieber, Fast approximate graph partitioning algorithms, SIAM J. Comput., 28 (1999), pp. 2187-2214.
3. S. Guha, Nested graph dissection and approximation algorithms, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 126-135.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
5. M. R. Garey and D. S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods, 4 (1983), pp. 312-316.
6. H. Gazit and G. L. Miller, Planar separators and the Euclidean norm, in Proceedings of the 1st International Symposium on Algorithms (SIGAL), Lecture Notes in Comput. Sci. 450, Springer-Verlag, Heidelberg, 1990, pp. 338-347.
7. C. E. Leiserson, Area-efficient graph layouts (for VLSI), in Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, NY, 1980, pp. 270-281.
8. F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, MA, 1983.
9. T. Leighton and S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46 (1999), pp. 787-832.
10. R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
11. J. Pach, F. Shahrokhi, and M. Szegedy, Applications of the crossing number, Algorithmica, 16 (1996), pp. 111-117.
12. F. Shahrokhi, and W. Shi, On crossing sets, disjoint sets, and pagenumber, J. Algorithms, 34 (2000), pp. 40-53.
13. F. Shahrokhi, O. Sýkora, L. A. Székely, and I. Vrťo, Crossing numbers: Bounds and applications, in Intuitive Geometry, Bolyai Soc. Math. Stud. 6, János Bolyai Math. Soc., Budapest, 1997, pp. 179-206.
14. J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984.
15. L. G. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput., 30 (1981), pp. 135-140.