Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
312
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
- COMBINATORICA
"... We present a factor 2 approximation algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, which is also known as the survivable network design problem. Our algorit ..."
Abstract
-
Cited by 266 (3 self)
- Add to MetaCart
We present a factor 2 approximation algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, which is also known as the survivable network design problem. Our
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using the a ..."
Abstract
-
Cited by 249 (38 self)
- Add to MetaCart
We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair fi; jg of nodes, an edge-connectivity requirement r ij . The goal is to find a minimum-cost network using
Approximation Algorithms for Directed Steiner Problems
- Journal of Algorithms
, 1998
"... We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing. For both problems, the best ratios known before our work we ..."
Abstract
-
Cited by 178 (8 self)
- Add to MetaCart
We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing. For both problems, the best ratios known before our work
A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics
- In Proceedings of the 35th Annual ACM Symposium on Theory of Computing
, 2003
"... In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon the result of Bartal who gave a bound of O(log n log log n). Moreover, our result is existentially tight; t ..."
Abstract
-
Cited by 306 (8 self)
- Add to MetaCart
; there exist metric spaces where any tree embedding must have distortion#sto n)-distortion. This problem lies at the heart of numerous approximation and online algorithms including ones for group Steiner tree, metric labeling, buy-at-bulk network design and metrical task system. Our result improves
A nearly best-possible approximation algorithm for node-weighted Steiner trees
, 1993
"... We give the first approximation algorithm for the node-weighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless ~ P ' NP . Our algorithm generalizes to handle other network design problems. ..."
Abstract
-
Cited by 138 (9 self)
- Add to MetaCart
We give the first approximation algorithm for the node-weighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless ~ P ' NP . Our algorithm generalizes to handle other network design problems.
A primal-dual approximation algorithm for generalized Steiner network problems
- Combinatorica
, 1995
"... M.I.T. We present the first polynomial-time approxima-tion algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, also called the survivable network design problem. ..."
Abstract
-
Cited by 94 (20 self)
- Add to MetaCart
M.I.T. We present the first polynomial-time approxima-tion algorithm for finding a minimum-cost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, also called the survivable network design problem
RNC-Approximation Algorithms for the Steiner Problem
- PROC. STACS'97
, 1997
"... In this paper we present an RNC-algorithm for finding a minimum spanning tree in a weighted 3-uniform hypergraph, assuming the edge weights are given in unary, and a fully polynomial time randomized approximation scheme if the edge weights are given in binary. From this result we then derive RNC-app ..."
Abstract
-
Cited by 16 (0 self)
- Add to MetaCart
algorithms for the Steiner problem in networks with approximation ratio (1 + ffl) 5=3 for all ffl ? 0.
The Prize Collecting Steiner Tree Problem
, 2000
"... This work is motivated by an application in local access network design that can be modeled using the NP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop seve ..."
Abstract
-
Cited by 103 (1 self)
- Add to MetaCart
This work is motivated by an application in local access network design that can be modeled using the NP-hard Prize Collecting Steiner Tree problem. We consider several variants on this problem and on the primal-dual 2-approximation algorithm devised for it by Goemans and Williamson. We develop
Steiner problem on networks
"... When trees collide: An approximation algorithm for the generalized ..."
Results 1 - 10
of
312
