| B. Awerbuch, Y. Bartal, and A. Fiat. Competitve distributed file allocation. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 164--173, 1993. |
....are connected to the backbone via direct links. The major requirement is that the total access cost for the users is within a specified bound, whereas the construction cost of the backbone network should be minimized. Similar problems arise in the efficient maintenance of distributed databases [28, 6, 5, 20, 9]. Other applications of BCCMED include location theory and manufacturing logistics (see [25, 27] and the references cited therein) In this paper, we study the complexity and approximability of BCCMED. The paper is organized as follows. In Section 2 we formally define the problem under study and ....
B. Awerbuch, Y. Bartal, and A. Fiat. Competitve distributed file allocation. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pages 164--173, 1993.
....to the backbone via direct links. The major requirement is that the total access cost for the users be within a specified bound, whereas the construction cost of the backbone network should be minimized. Problems of similar nature arise in the efficient maintenance of distributed databases [3, 4, 7, 15, 22]. Other applications of the Budget Constrained Connected Median Problem studied in this paper include location theory and manufacturing logistics (see [20, 21] and the references cited therein) The above problems can be cast in a graph theoretic framework as follows: Given an undirected graph G ....
B. Awerbuch, Y. Bartal, and A. Fiat, Competitve distributed file allocation, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 164--173.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC