Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany

No author found.

Publication date: 17 September 1992

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

Proceedings Meeting Paths Flows Bonn (Germany)VLSI-layout

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (8)

The shortest multipaths problem in a capacitated dense channel ⋮ On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems ⋮ Approximating maximum integral multiflows on bounded genus graphs ⋮ Multiflow Feasibility: An Annotated Tableau ⋮ Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity ⋮ On the approximability of time disjoint walks ⋮ Walking through waypoints ⋮ Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs

This page was built for publication: Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany