Skip to main content
SpringerLink
Log in

On the contact-minimization-problem

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

Abstract

The contact minimization problem is the problem of determining which layers should be used for wiring the signal nets of a circuit, such that the total number of layer changes (called contacts or via holes) is minimized. In this paper we show how to use a polynomialtime algorithm to find a maximum matching for a graph to solve the contact minimization problem for two layers. Furthermore we show that the contact minimization problem for n layers is NP-complete for all fixed n≥3.

Extended abstract

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Barahona: “Sur la complexité du problème du verre de spins” Rapport de Recherche 171, Octobre 1979, Université Scientifique Et Medicale et Institut National Polytechnique de Grenoble, Mathematiques Appliquées et Informatique.

    Google Scholar 

  2. M. Brady, D. Brown: “VLSI Routing: Four Layers Suffice” Advances in Computing Research, vol. 2 pages 245–257, JAI Press Inc London.

    Google Scholar 

  3. M. Ciesielski, E.Kinnen: “An Optimum Layer Assignment for Routing in IC's and PCB's” Proceedings of the 18th Design Automation Conference, June 1981, pp. 733–737.

    Google Scholar 

  4. H. Gabow: “Implementation of Algorithms for Maximum Matching on Non-Bipartite Graphs” Ph.D. Dissertation, Stanford University 1973.

    Google Scholar 

  5. M. Garey, D. Johnson: “Computers and Intractability: A Guide to the Theory of NP-completeness” W.H.Freeman & co., San Francisco, 1979

    Google Scholar 

  6. Y. Kajitani: “On Via Hole Minimization of Routing on a 2-layer Board” Proceedings of the ICCC 1980, pp.295–298

    Google Scholar 

  7. W. Lipski: “An NP-complete problem related to three layer channel routing” Manuscript, Institute of Computer Science, PAS, Warsaw, Poland 1982.

    Google Scholar 

  8. S. MacLane: “A combinatorial condition for planar graphs” Fundamenta Math. 28, 22–32 (1937)

    Google Scholar 

  9. P. Molitor: “Layer Assignment by Simulated Annealing” North-Holland, Microprocessing and Microprogramming 16 (1985), pp.345–350

    Google Scholar 

  10. R.Y.Pinter: “Optimal Layer Assignment for Interconnect” Proceedings of the ICCC 1982, pp.398–401

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 10, Universität des Saarlandes, D-6600, Saarbrücken, FRG

    Paul Molitor

Authors
  1. Paul Molitor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Molitor, P. (1987). On the contact-minimization-problem. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039624

Download citation

  • DOI: https://doi.org/10.1007/BFb0039624

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation