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
.
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems
[article]
2015
arXiv
pre-print
We consider single-sink network flow problems. An instance consists of a capacitated graph (directed or undirected), a sink node t and a set of demands that we want to send to the sink. Here demand i is located at a node s_i and requests an amount d_i of flow capacity in order to route successfully. Two standard objectives are to maximise (i) the number of demands (cardinality) and (ii) the total demand (throughput) that can be routed subject to the capacity constraints. Furthermore, we examine
arXiv:1504.00627v2
fatcat:i2fmgalrgfgh7hfsry4rnugk74