Capacitated Network Design Problems: Hardness, Approximation Algorithms, and Connections to Group Steiner Tree��� (original) (raw)
Related papers
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Siam Journal on Computing, 1995
Approximation algorithms for directed Steiner problems
Proceedings of the …, 1998
Approximating some network design problems with node costs
Theoretical Computer Science, 2011
Strong Formulations for 2-Node-Connected Steiner Network Problems
Lecture Notes in Computer Science, 2008
The Steiner connectivity problem
Mathematical Programming, 2012
On-line generalized Steiner problem
Theoretical Computer Science, 2004
Approximating buy-at-bulk k-steiner trees
2005
Directed Steiner problems with connectivity constraints
Discrete Applied Mathematics, 1993
Set connectivity problems in undirected graphs and the directed Steiner network problem
ACM Transactions on Algorithms, 2011
Approximating the Generalized Capacitated Tree-Routing Problem
Lecture Notes in Computer Science, 2008
An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Polynomially solvable special cases of the Steiner problem in planar networks
Annals of Operations Research, 1991
Approximating Rooted Steiner Networks
Adrian Vetta, Bundit Laekhanukit
ACM Transactions on Algorithms, 2014
The Steiner problem with edge lengths 1 and 2
Information Processing Letters, 1989
Solving the Steiner Tree Problem with Revenues,Budget and Hop Constraints to optimality
In : 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO). IEEE conference, 2013
The Minimum Degree Group Steiner Tree problem on Bounded Treewidth Graphs and Applications
2019
New real-world instances for the steiner tree problem in graphs
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics, 2006
An estimate of the objective function optimum for the network Steiner problem
Annals of Operations Research, 2015
Approximating minimum cost connectivity problems
2000
Some Formulations for the Group Steiner Tree Problem
Electronic Notes in Discrete Mathematics, 2004
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011
Kruskal-based approximation algorithm for the multi-level Steiner tree problem
2020
Building Steiner trees with incomplete global knowledge
Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000
European Journal of Operational Research, 2010
On the Fixed Cost k-Flow Problem and related problems⋆
On Approximating Degree-Bounded Network Design Problems
2020
The Euclidean Bottleneck Full Steiner Tree Problem
Algorithmica, 2013
A Computational Study for the Steiner Tree Problem with Revenue, Budget and Hop Constraints
HAL (Le Centre pour la Communication Scientifique Directe), 2013
Solving steiner tree problems in graphs with lagrangian relaxation
2003
On subexponential running times for approximating directed Steiner tree and related problems
arXiv (Cornell University), 2018
The euclidean bottleneck steiner path problem
Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG '11, 2011
Cornell University - arXiv, 2022
On Approximation of the Power-p and Bottleneck Steiner Trees
Combinatorial Optimization, 2000