Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1663))

Included in the following conference series:

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.

This work was supported by a grant from Cadence Design Systems, Inc. P. Berman was partially supported by NSF Grant CCR-9700053 and A. Zelikovsky was partially supported by GSU Research Initiation Grant #00-013.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    MATH  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

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

    MATH  Google Scholar 

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

  6. H. N. Gabow and R. E. Tarjan, “Faster scaling algorithms for general graph matching problems”, Journal of the ACM 38 (1991) 815–853.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. X. Goemans and D. P. Williamson, “A general approximation technique for constrained forest problems”, SIAM Journal on Computing 24 (1995) 296–317.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. O. Hadlock, “Finding a Maximum Cut of a Planar Graph in Polynomial Time”, SIAM J. Computing 4(3) (1975), pp. 221–225.

    Article  MathSciNet  MATH  Google Scholar 

  9. A. B. Kahng and H. Wang, “Toward Lithography-Aware Layout: Preliminary Litho Notes”, manuscript, July 1997.

    Google Scholar 

  10. A. B. Kahng, H. Wang and A. Zelikovsky, “Automated Layout and Phase Assignment Techniques for Dark Field Alternating PSM”, SPIE 11th Annual BACUS Symposium on Photomask Technology, SPIE 1604 (1998), pp. 222–231.

    Google Scholar 

  11. M. D. Levenson, N. S. Viswanathan and R. A. Simpson, “Improving Resolution in Photolithography with a Phase-Shifting Mask”, IEEE Trans. on Electron Devices ED-29(11) (1982), pp. 1828–1836.

    Article  Google Scholar 

  12. R. J. Lipton and R. E. Tarjan, “A separator theorem for planar graphs”, SIAM J. Appl. Math., 36 (1979), pp. 177–189.

    Article  MathSciNet  MATH  Google Scholar 

  13. A. Moniwa, T. Terasawa, K. Nakajo, J. Sakemi and S. Okazaki, “Heuristic Method for Phase-Conict Minimization in Automatic Phase-Shift Mask Design”, Jpn. J. Appl. Phys. 34 (1995), pp. 6584–6589.

    Article  Google Scholar 

  14. M. Müller-Hannemann and K. Weihe, “Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes”, Proc. ESA’97, Graz, Austria, pp. 364–377.

    Google Scholar 

  15. K. Ooi, K. Koyama and M. Kiryu, “Method of Designing Phase-Shifting Masks Utilizing a Compactor”, Jpn. J. Appl. Phys. 33 (1994), pp. 6774–6778.

    Article  Google Scholar 

  16. G. I. Orlova and Y. G. Dorfman, “Finding the Maximum Cut in a Graph”, Engr. Cybernetics 10 (1972), pp. 502–506.

    MathSciNet  MATH  Google Scholar 

  17. SIA, The National Technology Roadmap for Semiconductors, Semiconductor Industry Association, December 1997.

    Google Scholar 

  18. D. P. Williamson and M. X. Goemans, “Computational experience with an approximation algorithm on large-scale Euclidean matching instances”, INFORMS Journal of Computing, 8 (1996) 29–40.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, Pennsylvania State University, University Park, PA, 16802-6106

    Piotr Berman

  2. Department of Computer Science, University of California at Los Angeles, Los Angeles, CA, 90095-1596

    Andrew B. Kahng & Devendra Vidhani

  3. Department of Computer Science, Georgia State University, University Plaza, Atlanta, GA, 30303

    Alexander Zelikovsky

Authors
  1. Piotr Berman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew B. Kahng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Devendra Vidhani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexander Zelikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Canada, K1S 5B6

    Frank Dehne  & Jörg-Rüdiger Sack  & 

  2. School of Computer Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6

    Arvind Gupta

  3. Center for Geometric Computing Providence, Brown University, RI, 02912-1910, USA

    Roberto Tamassia

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66279-2

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation