Paths, Flows, and VLSI-Layout

Paths, Flows, and VLSI-Layout

by Bernhard Korte, Alexander Schrijver, H. J. Promel, László Lovász
     
 

ISBN-10: 0387526854

ISBN-13: 9780387526850

Pub. Date: 12/01/1990

Publisher: 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

Overview

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.

Product Details

ISBN-13:
9780387526850
Publisher:
Springer-Verlag New York, LLC
Publication date:
12/01/1990
Series:
Algorithms and Combinatorics Series, #9
Pages:
383

Table of Contents

Contents: 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.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >