Summary
We investigate the complexity and approximability of network flow improvement problems. In these problems, one incurs costs for increasing the capacity of an edge, while the goal is to achieve a flow of maximum value through the network. We study several improvement strategies. Furthermore, we investigate the relationship of network flow improvement problems to network fixed cost flow problems, where one incurs a fixed charge for each edge with nonzero flow which does not depend on the amount of flow sent over the edge. All fixed cost problems studied in this paper are NP-hard to solve. We present various approximation algorithms for the problems under study.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks flows, Prentice Hall, EnglewoodCliffs, New Jersey, 1993.
S. Arora and M. Sudan, Improved low-degree testing and its applications, Proceedingsof the 29th Annual ACM Symposium on the Theory of Computing (STOC’97), 1997,pp. 485–496.
M. W. Bern, E. L. Lawler, and A. L. Wong, Linear-time computation of optimal subgraphsof decomposable graphs, Journal of Algorithms 8 (1987), 216–235.
U. Feige, A threshold o/lnn for approximating set cover, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC’96), 1996, pp. 314–318.
M. R. Garey and D. S. Johnson, Computers and intractability (a guide to the theory of NP-completeness), W.H. Freeman and Company, New York, 1979.
G. M. Guisewite and P. M. Pardalos, Minimum concave-cost network flow problems: Applications, complexity and algorithms, Annals of Operations Research 25 (1990), 75–100.
S. O. Krumke, On the approximability of location and network design problems, Ph.D. thesis, Lehrstuhl für Informatik I, Universität Würzburg, December 1996.
M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Bicriteria network design problems, Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP’95), Lecture Notes in Computer Science, vol. 944, 1995, pp. 487–498.
R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III, Many birds with one stone: Multi-objective approximation algorithms, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC’93), May 1993, pp. 438–447.
S. Schwarz and S. O. Krumke, On budget constrained flow improvement, Information Processing Letters 66 (1998), 291–297.
J. Valdes, R. E. Tarjan, and E. L. Lawler, The recognition of series-parallel digraphs, SIAM Journal on Computing 11 (1982), no. 2, 298–313.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krumke, S.O., Noltemeier, H., Schwarz, S., Wirth, HC., Ravi, R. (1999). Flow Improvement and Network Flows with Fixed Costs. In: Kall, P., Lüthi, HJ. (eds) Operations Research Proceedings 1998. Operations Research Proceedings 1998, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58409-1_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-58409-1_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65381-3
Online ISBN: 978-3-642-58409-1
eBook Packages: Springer Book Archive