Skip to main content
SpringerLink
Log in

Some combinatorial optimization problems arising from VLSI circuit design

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

This paper is basically a survey to show a number of combinatorial optimization problems arising from VLSI circuit design. Some of them including the existence problem, minimax problem, net representation, bend minimization, area minimization, placement problem, routing problem, etc. are especially discussed with new results and theoretical ideas for treating them. Finally, a number of problems for further research are mentioned.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cui S. F. and Liu Y. P., Efficient algorithms for rectilinear extensions of standard graphs.Acta Math. Appl. Sinica (in Chinese), to appear.

  2. Hu T. C. and Kuh, S. E., Theory and concepts of circuit layout in VLSI circuit design: Theory and Design,IEEE Press, 1985, 3–18.

  3. Jaumard, B., Marchioro, P., Morgana, A., Petreschi, R., and Simeone, B., On-line 2-satisfiability.Ann. Math. Artificial Intel., 1 (1990), 155–165.

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Liu, Y. P., Marchioro, P., and Petreschi, P., At most single-bend embeddings of cubic graphs. Reserch Report 002, Inst., Appl. Math. Academia Sinica, 1992, and SI 92/01. Dept. Comp. Sa., University “La Saprenza” of Rome, 1992.

  6. Liu Y. P., Marchioro, P., Petreschi, P., and Simeone, B., Theoretical results on at most 1-bend embeddability of graphs, Research Report Series A, No. 3, Department of Statistics, University of Rome “La Sapienza”, 1990. Also inActa Math. Appl. Sinica 8:2 (1992), 188–192.

  7. Liu, Y. P., Morgans, A., and Simeonne, B., General theoretical results on rectilinear embeddability of graphs, Research Report Series A, No. 2. Department of Statistics, University of Rome “La Sapienza”. 1990. Also inActa Math. Appl Sinica,7: 2 (1991), 187–192.

  8. Liu Y. P., On the net-embeddability of graphs, RUTCOR Research Report RRR8-90. Rutgers University. 1990. Also inActa Math. Sinica, New Series,8 (1992), 413–423.

  9. Liu, Y. P., The efficient recognition on net-embeddability of graphs, Research Report, Inst. Appl. Math. Academia Sinica, 1991. Aslo inChinese Sci Bull.,38, (1993), 533–536.

  10. Liu Y. P., Rectilinear Embeddings: Theory and Methods (in Chinese), Science Press, 1993.

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics, Academia Sinica, 100080, Beijing

    Liu Yanpei

Authors
  1. Liu Yanpei
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yanpei, L. Some combinatorial optimization problems arising from VLSI circuit design. Appl. Math. 8, 218–235 (1993). https://doi.org/10.1007/BF02662005

Download citation

  • Received:

  • Issue Date:

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

Key Words

Search

Navigation