Optimum path packing on wheels: The consecutive case

DOI10.1016/0898-1221(96)00058-2zbMath0853.90112OpenAlexW2088983627MaRDI QIDQ1921239

Alexander Martin, Martin Grötschel, Robert Weismantel

Publication date: 6 January 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00058-2

zbMATH Keywords

VLSI designwheelrouting algorithmspath packing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Cites Work

• Multicommodity flows in planar graphs
• Packing Steiner trees: Polyhedral investigations
• Packing Steiner trees: A cutting plane algorithm and computational results
• Routing through a Dense Channel with Minimum Total Wire Length
• Unnamed Item
• Unnamed Item
• Unnamed Item