Introduction to algorithms
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Cost and availability tradeoffs in replicated data concurrency control
ACM Transactions on Database Systems (TODS)
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
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
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
Placement of Replicated Items in Distributed Databases
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Bicriteria Network Design Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
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
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Budget Constrained Minimum Cost Connected Medians
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Several practical instances of network design problems often require the network to satisfy multiple constraints. In this paper, we focus on the following problem (and its variants): find a low-cost network, under one cost function, that services every node in the graph, under another cost function, (i.e., every node of the graph is Within a prespecified distance from the network). Such problems find applications in optical network design and the efficient maintenance of distributed databases.We utilize the framework developed in Marathe et al. [1995] co formulate these problems as bicriteria network design problems, and present approximation algorithms for a class of service-constrained network design problems. We also present lower bounds on the approximability of these problems that demonstrate that our performance ratios are close to best possible.