The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout

Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky. The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. In Frank K. H. A. Dehne, Arvind Gupta, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 6th International Workshop, WADS 99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings. Volume 1663 of Lecture Notes in Computer Science, pages 25-36, Springer, 1999. [doi]

Abstract

Abstract is missing.