The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout-Reference-Cited by-同舟云学术

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

Published:1999 Issue: Volume: Page:25-36
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Berman Piotr,Kahng Andrew B.,Vidhani Devendra,Zelikovsky Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48447-7_3

Reference18 articles.

1. A. V. Aho, J. E. Hopcroft and J. D. Ulman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, MA, 1974.

2. F. Barahona, “Planar multicommodity flows, max cut and the Chinese postman problem”, In W. Cook and P. D. Seymour, eds., Polyhedral Combinatorics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1 (1990), pp. 189–202.

3. P. Berman, A. B. Kahng, D. Vidhani, H. Wang and A. Zelikovsky, “Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks”, Proc. ACM/IEEE Intl. Symp. on Physical Design, 1999, to appear.

4. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank and A. Shrijver, Combinatorial Optimization, Willey Inter-Science, New York, 1998.

5. W. Cook and A. Rohe, “Computing Minimum-Weight Perfect Matchings”, http://www.or.uni-bonn.de/home/rohe/matching.html , manuscript, August, 1998.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Min-Deviation-Flow in Bi-directed Graphs for T-Mesh Quantization;ACM Transactions on Graphics;2023-07-26

2. On matchings, T ‐joins, and arc routing in road networks;Networks;2021-03-05

3. Resolution Enhancement Techniques and Mask Data Preparation;Electronic Design Automation for IC Implementation, Circuit Design, and Process Technology;2016-04-14

4. Partitioning planar graphs: a fast combinatorial approach for max-cut;Computational Optimization and Applications;2010-06-09