@inproceedings{042a0c0adbb34755ad44e420504305ba,

title = "The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout",

abstract = "Given a graph G with weighted edges, and a subset of nodes T, the T-join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A iff u ∈ T. We describe the applications of the T-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal refinement of finite element meshes. We suggest a practical algorithm for the Tjoin problem. In sparse graphs, this algorithm is faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithm.",

author = "Piotr Berman and Kahng, {Andrew B.} and Devendra Vidhani and Alexander Zelikovsky",

year = "1999",

doi = "10.1007/3-540-48447-7_3",

language = "English (US)",

isbn = "3540662790",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "25--36",

editor = "Frank Dehne and Jorg-Rudiger Sack and Arvind Gupta and Roberto Tamassia",

booktitle = "Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings",

address = "Germany",

note = "6th International Workshop on Algorithms and Data Structures, WADS 1999 ; Conference date: 11-08-1999 Through 14-08-1999",

}