The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Competitive algorithms for distributed data management
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Bicriteria network design problems
Journal of Algorithms
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Service-constrained network design problems
Nordic Journal of Computing
| Hi-index | 0.00 |
Several practical instances of network design problems require the network to satisfy multiple constraints. In this paper, we address the Budget Constrained Connected Median Problem: We are given an undirected graph G = (V, E) with two different edge-weight functions c (modeling the construction or communication cost) and d (modeling the service distance), and a bound B on the total service distance. The goal is to find a subtree T of G with minimum c-cost c(T) subject to the constraint that the sum of the service distances of all the remaining nodes υ ∈ V \ T to their closest neighbor in T does not exceed the specified budget B. This problem has applications in optical network design and the efficient maintenance of distributed databases. We formulate this problem as bicriteria network design problem, and present bicriteria approximation algorithms. We also prove lower bounds on the approximability of the problem that demonstrate that our performance ratios are close to best possible.