Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
Bicriteria network design problems
Journal of Algorithms
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
A Constant-Factor Approximation Algorithm for the Multicommodity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximating Some Network Design Problems with Node Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Cost-Distance: Two Metric Network Design
SIAM Journal on Computing
Survivable Network Design with Degree or Order Constraints
SIAM Journal on Computing
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Approximation algorithms for the directed k-tour and k-stroll problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Hi-index | 0.00 |
In this paper we give improved approximation algorithms for some network design problems. In the Bounded-Diameter or Shallow-Light k-Steiner tree problem (SLkST), we are given an undirected graph G=(V,E) with terminals T⊆V containing a root r∈T, a cost function c:E→ℝ+, a length function ℓ:E→ℝ+, a bound L0 and an integer k≥1. The goal is to find a minimum c-cost r-rooted Steiner tree containing at least k terminals whose diameter under ℓ metric is at most L. The input to the Buy-at-Bulk k-Steiner tree problem (BBkST) is similar: graph G=(V,E), terminals T⊆V, cost and length functions c,ℓ:E→ℝ+, and an integer k≥1. The goal is to find a minimum total cost r-rooted Steiner tree H containing at least k terminals, where the cost of each edge e is c(e)+ℓ(e)·f(e) where f(e) denotes the number of terminals whose path to root in H contains edge e. We present a bicriteria (O(log2n),O(logn))-approximation for SLkST: the algorithm finds a k-Steiner tree of diameter at most O(L·logn) whose cost is at most $O(\log^2 n\cdot\mbox{\sc opt}^*)$ where $\mbox{\sc opt}^*$ is the cost of an LP relaxation of the problem. This improves on the algorithm of [9] with ratio (O(log4n), O(log2n)). Using this, we obtain an O(log3n)-approximation for BBkST, which improves upon the O(log4n)-approximation of [9]. We also consider the problem of finding a minimum cost 2-edge-connected subgraph with at least k vertices, which is introduced as the (k,2)-subgraph problem in [14]. We give an O(logn)-approximation algorithm for this problem which improves upon the O(log2n)-approximation of [14].