Abstract
In the network inhibition problem, we wish to expend a limited budget attacking a given edge-capacitated graph by “paying” to remove edge capacity from some subset of the edges. We wish to minimize the resulting maximum flow between two designated vertices s and t. The problem is strongly NP-hard. Previous approximation algorithms applied only to planar graphs. In this chapter, we give a polynomial-time algorithm, based on a linear-programming relaxation of an integer program, that finds an attack with cost B a and residual network capacity (max flow) C a such that
where ε>0 is a given error parameter, B is the given budget (the amount of resources to expend damaging the network), and C* is the minimum (optimal) residual capacity for any attack with budget B. For example, our algorithm returns a (1,1+1/ε)-approximation or a (1+ε, 1)-pseudoapproximation, but we do not know which a priori. The parameter ε biases the nature of the solution, but does not affect the running time.
We generalize the pseudoapproximation algorithm to multiple attack methods/budgets and give a polynomial-time algorithm to compute the most cost-effective attack.
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
Bar-Noy, A., Guha, S., Naor, J., and Schieber, B. (2001). Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing, 31(2):331–352.
Boyd, S. and Carr, R. (1999). A new bound for the ratio between the 2-matching problem and its linear programming relaxation. Mathematical Programming, Ser A, 86:499–514.
Burch, C, Carr, R. D., Krumke, S. O., Marathe, M., Phillips, C, and Sundberg, E. (2001). Multicriteria approximation through decomposition. (unpublished manuscript).
Ford, L. R. and Fulkerson, D. R. (1962). Flows in Networks. Princeton University Press, Princeton, NJ.
Ghare, P. M., Montgomery, D. C., and Turner, W. C. (1971). Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly, 18:37–45.
Helmbold, R. L. (1971). A counter capacity network interdiction model. Technical Report R-611-PR, Rand Corporation, Santa Monica, CA.
Krumke, S. O., Noltemeier, H., Ravi, S. S., Marathe, M. V., and Drangmeister, K. U. (1998). Modifying networks to obtain low cost subgraphs. Theoretical Computer Science, 203(1):91–121. A preliminary version appeared in the Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, 1996, vol. 1197 of Lecture Notes in Computer Science.
Marathe, M. V., Ravi, R., Sundaram, R., Ravi, S. S., Rosenkrantz, D. J., and Hunt III, H. B. (1998). Bicriteria network design problems. Journal of Algorithms, 28(1): 142–171.
McMasters, A. W. and Mustin, T. M. (1970). Optimal interdiction of a supply network. Naval Research Logistics Quarterly, 17(3): 261–268.
Naor, J. and Schieber, B. (1997). Improved approximations for shallow-light spanning trees. In Proceedings of the 38th Annual IEEE Symposium on the Foundations of Computer Science, pages 536–541.
Nemhauser, G. L. and Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons.
Phillips, C. (1993). The network inhibition problem. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 776–785.
Phillips, C. A., Uma, R. N., and Wein, J. (2002+). Off-line admission control for general scheduling problems. Journal of Scheduling, to appear.
Schrijver, A. (1986). Theory ofLinear and Integer Programming. John Wiley & Sons.
Shmoys, D. (1997). Personal communication.
Srinivasan, A. (1997). A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 636–643.
Wood, K. (1993). Deterministic network interdiction. Mathmatical and Computer Modeling, 17(2):1–18.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Burch, C., Carr, R., Krumke, S., Marathe, M., Phillips, C., Sundberg, E. (2003). A Decomposition-Based Pseudoapproximation Algorithm for Network Flow Inhibition. In: Woodruff, D.L. (eds) Network Interdiction and Stochastic Integer Programming. Operations Research/Computer Science Interfaces Series, vol 22. Springer, Boston, MA. https://doi.org/10.1007/0-306-48109-X_3
Download citation
DOI: https://doi.org/10.1007/0-306-48109-X_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7302-1
Online ISBN: 978-0-306-48109-3
eBook Packages: Springer Book Archive