The weighted 2-server problem
✍ Scribed by Marek Chrobak; Jiřı́ Sgall
- Book ID
- 108280963
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 310 KB
- Volume
- 324
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Algorithms Ž . x 11 1990 , 208᎐230 in a distributed setting. Given a network of n processors and k identical mobile servers, requests for service appear at the processors and a server must reach the request point. In addition to modeling problems in computer networks where k identical mobile resour
## Abstract Consider a network of __k__ servers and their users. Each server provides a unique service that has a certain utility for each user. Now comes an attacker who wishes to destroy a set of network edges to maximize his net gain, namely the total disconnected utilities of the users minus th