Abstract
Consider a set of users and servers connected by a network. Each server provides a unique service which is of certain benefit to each user. Now comes an attacker, who wishes to destroy a set of edges of the network in the fashion that maximizes his net gain, namely, the total disconnected benefit of users minus the total edge-destruction cost. We first discuss that the problem is polynomially solvable in the single-server case. In the multiple-server case, we will show, the problem is, however, NP-hard. In particular, when there are only two servers, the network disconnection problem becomes intractable. Then a \(\frac{3}{2}\)-approximation algorithm is developed for the two-server case.
The research was partially supported by KOSEF research fund R01-2005-000-10271-0.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Berlin (1999)
Burlet, M., Goldschmidt, O.: A new and improved algorithm for the 3-cut problem. Operations Research Letters 21, 225–227 (1997)
Călinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for muliway cut. In: Proc. 30th ACM Symposium on Theory of Computing, pp. 48–52. ACM, New York (1998)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM Journal on Computing 23, 864–894 (1994)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)
Garg, N., Vazirani, V.V., Yanakakis, M.: Approximating max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing 25, 235–251 (1996)
Goldschmidt, O., Hochbaum, D.S.: A polynomial time algorithm for the k-cut problem for k fixed. Mathematics of Operations Research 19, 24–37 (1994)
Martel, C., Nuckolls, G., Sniegowski, D.: Computing the disconnectivity of a graph, UC Davis (2001) manuscript
Maor, J., Zosin, L.: A 2-approximation algorithm for the directed multiway cut problem. SIAM Journal on Computing 31, 477–482 (2001)
Picard, J.C., Ratliff, H.D.: Minimum cuts and related problems. Networks 5, 357–370 (1974)
Saran, H., Vazirani, V.V.: Finding k-cuts within twice the optimal. In: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 743–751. IEEE Computer Society, Los Alamitos (1991)
Yannakakis, M., Kanellakis, P.C., Cosmadakis, S.C., Papadmitriou, C.H.: Cutting and partitioning a graph after a fixed pattern, in Automata, Language and Programming. Lecture Notes and Computer Science, vol. 154, pp. 712–722 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, BC., Hong, SP. (2006). Two-Server Network Disconnection Problem. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_83
Download citation
DOI: https://doi.org/10.1007/11751595_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)