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

Authors:
Piotr Berman;Andrew B. Kahng;Devendra Vidhani;Alexander Zelikovsky
Affiliations:
-;-;-;-
Venue:
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Year:
1999

Citing 6
Cited 1

Faster scaling algorithms for general graph matching problems

Journal of the ACM (JACM)
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Combinatorial optimization

Combinatorial optimization
Optimal phase conflict removal for layout of dark field alternating phase shifting masks

ISPD '99 Proceedings of the 1999 international symposium on Physical design
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes

ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms

Partitioning planar graphs: a fast combinatorial approach for max-cut

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

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 T-join 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.