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

doi:10.1007/3-540-48447-7_3

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

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.

Original language	English (US)
Title of host publication	Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings
Editors	Frank Dehne, Jorg-Rudiger Sack, Arvind Gupta, Roberto Tamassia
Publisher	Springer Verlag
Pages	25-36
Number of pages	12
ISBN (Print)	3540662790, 9783540662792
DOIs	https://doi.org/10.1007/3-540-48447-7_3
State	Published - 1999
Event	6th International Workshop on Algorithms and Data Structures, WADS 1999 - Vancouver, Canada Duration: Aug 11 1999 → Aug 14 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1663
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	6th International Workshop on Algorithms and Data Structures, WADS 1999
Country/Territory	Canada
City	Vancouver
Period	8/11/99 → 8/14/99

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-48447-7_3

Cite this

Berman, P., Kahng, A. B., Vidhani, D., & Zelikovsky, A. (1999). The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout. In F. Dehne, J-R. Sack, A. Gupta, & R. Tamassia (Eds.), Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings (pp. 25-36). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1663). Springer Verlag. https://doi.org/10.1007/3-540-48447-7_3

Berman, Piotr ; Kahng, Andrew B. ; Vidhani, Devendra et al. / The T-join problem in sparse graphs : Applications to phase assignment problem in VLSI mask layout. Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. editor / Frank Dehne ; Jorg-Rudiger Sack ; Arvind Gupta ; Roberto Tamassia. Springer Verlag, 1999. pp. 25-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@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",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 6th International Workshop on Algorithms and Data Structures, WADS 1999 ; Conference date: 11-08-1999 Through 14-08-1999",

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",

}

Berman, P, Kahng, AB, Vidhani, D & Zelikovsky, A 1999, The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout. in F Dehne, J-R Sack, A Gupta & R Tamassia (eds), Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1663, Springer Verlag, pp. 25-36, 6th International Workshop on Algorithms and Data Structures, WADS 1999, Vancouver, Canada, 8/11/99. https://doi.org/10.1007/3-540-48447-7_3

The T-join problem in sparse graphs : Applications to phase assignment problem in VLSI mask layout. / Berman, Piotr; Kahng, Andrew B.; Vidhani, Devendra et al.

Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. ed. / Frank Dehne; Jorg-Rudiger Sack; Arvind Gupta; Roberto Tamassia. Springer Verlag, 1999. p. 25-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1663).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - The T-join problem in sparse graphs

T2 - 6th International Workshop on Algorithms and Data Structures, WADS 1999

AU - Berman, Piotr

AU - Kahng, Andrew B.

AU - Vidhani, Devendra

AU - Zelikovsky, Alexander

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84948980123&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948980123&partnerID=8YFLogxK

U2 - 10.1007/3-540-48447-7_3

DO - 10.1007/3-540-48447-7_3

M3 - Conference contribution

AN - SCOPUS:84948980123

SN - 3540662790

SN - 9783540662792

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 25

EP - 36

BT - Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings

A2 - Dehne, Frank

A2 - Sack, Jorg-Rudiger

A2 - Gupta, Arvind

A2 - Tamassia, Roberto

PB - Springer Verlag

Y2 - 11 August 1999 through 14 August 1999

ER -

Berman P, Kahng AB, Vidhani D, Zelikovsky A. The T-join problem in sparse graphs: Applications to phase assignment problem in VLSI mask layout. In Dehne F, Sack J-R, Gupta A, Tamassia R, editors, Algorithms and Data Structures - 6th International Workshop, WADS 1999, Proceedings. Springer Verlag. 1999. p. 25-36. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48447-7_3

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this