A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems
[article]
2015
arXiv
pre-print
Preserved Fulltext
Other Versions
Furthermore, we examine these maximisation problems for three specialised types of network flow: unsplittable, confluent and priority flows. ...
In the confluent flow problem, we have node capacities, and the final flow must induce a tree. Both of these problems have been studied extensively, primarily in the single-sink setting. ...
The authors thank Guyslain Naves for his careful reading and precise and helpful comments. The authors gratefully acknowledge support from the NSERC Discovery Grant Program. ...
arXiv:1504.00627v2
fatcat:i2fmgalrgfgh7hfsry4rnugk74
Network Flow Problems Arising From Evacuation Planning
[article]
2012
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We assume we are given a network of the area to be evacuated, with sources describing the locations of evacuees, and sinks describing safe areas. ...
We discuss the effects of flow conservation for our generalized model, as well as the complexity of the associated transshipment problem under various settings. ...
One can use MaxConf-Flow to model the decision version of their problem using a single sink s − , but their inapproximability within a factor of 1 2 log 2 |δ in (s − )|−ε does not carry over to the maximum ...
doi:10.14279/depositonce-3327
fatcat:ldwqwcb6e5hchbjstboirlq4gm