S-Space College of Engineering/Engineering Practice School (공과대학/대학원) Dept. of Industrial Engineering (산업공학과) Journal Papers (저널논문_산업공학과)
Two-Server Network Disconnection Problem
- Choi, Byung-Cheon; Hong, Sung-Pil
- Issue Date
- Springer Verlag
- Lecture Notes in Computer Science, Vol. 3982/2006 (2006) 785-792
- 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 -approximation algorithm is developed for the two-server case.
- 0302-9743 (print)
- Files in This Item: There are no files associated with this item.