Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

On the Bottleneck Shortest Path Problem

Please always quote using this URN: urn:nbn:de:0297-zib-9160
  • The Bottleneck Shortest Path Problem is a basic problem in network optimization. The goal is to determine the limiting capacity of any path between two specified vertices of the network. This is equivalent to determining the unsplittable maximum flow between the two vertices. In this note we analyze the complexity of the problem, its relation to the Shortest Path Problem, and the impact of the underlying machine/computation model.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Volker Kaibel, Matthias Peinhardt
Document Type:ZIB-Report
Tag:linear time algorithm; shortest path; unsplittable flow
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization
Date of first Publication:2006/05/04
Series (Serial Number):ZIB-Report (06-22)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.