Paths, Flows, and VLSI-Layout available in Hardcover
- Pub. Date:
- Springer-Verlag New York, LLC
VLSI (very large scale integration) is a magic acronym in modern science and technology. Amongst other strik- ing aspects this field has turned out to be an excellent arena for applications of discrete mathematics and combinatorial optimization. The contributions to this volume, covering a wide range of research in this important field, develop from lectures delivered at a scientific meeting focused on paths, flows and VLSI-layout, held in Bonn in the summer 1988. The speakers, including several of the most prominent researchers in the field, were asked to formalize and extend their lectures into written surveys, giving a complete account of their topics. The volume will serve as a compendium demonstrating the liveliness of the area, as well as indicating directions for future work.
Table of ContentsContents: F. Barahona: On Some Applications of the Chinese Postman Problem.- F.R.K. Chung: Separator Theorems and Their Applications.- P. Erdös: Some of my Old and New Combinatorial Problems.- A. Frank: Packing Paths, Circuits and Cuts - A Survey.- A.V. Goldberg, E. Tardos, R.E. Tarjan: Network Flow Algorithms.- M. Kaufmann, K. Mehlhorn: Routing Problems in Grid Graphs.- B. Korte, H.J. Prömel, A. Steger: Steiner Trees in VLSI-Layout.- M.V. Lomonosov: Cycles Through Prescribed Elements in a Graph.- L. Lovász: Communication Complexity: A Survey.- N. Robertson, P.D. Seymour: An Outline of a Disjoint Paths Algorithm.- N. Robertson, R. Vitray: Representativity of Surface Embeddings.- A. Schrijver: Homotopic Routing Methods.- Author Index.- Subject Index.