Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities

Publikationsart
Zeitschriftenbeiträge (peer-reviewed)
Titel
Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities
Medien
Networks
Heft
2
Band
62
Autoren
Prof. Dr. Clemens Thielen , Stephan Westphal
Seiten
125-131
Veröffentlichungsdatum
04.03.2013
Zitation
Thielen, Clemens; Westphal, Stephan (2013): Complexity and Approximability of the Maximum Flow Problem with Minimum Quantities. Networks 62 (2), S. 125-131. DOI: 10.1002/net.21502