A factoring approach for the Steiner tree problem in undirected networks
Information Sciences: an International Journal
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
On the partial terminal Steiner tree problem
The Journal of Supercomputing
Automated antenna positioning algorithms for wireless fixed-access networks
Journal of Heuristics
Algorithms for terminal Steiner trees
Theoretical Computer Science
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stochastic Steiner Tree with Non-uniform Inflation
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On Optimal Solutions for the Optimal Communication Spanning Tree Problem
Operations Research
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
ACM Transactions on Algorithms (TALG)
Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree
Journal of Parallel and Distributed Computing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
New geometry-inspired relaxations and algorithms for the metric steiner tree problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Constrained relay node placement in wireless sensor networks: formulation and approximations
IEEE/ACM Transactions on Networking (TON)
Optimized relay placement to federate segments in wireless sensor networks
IEEE Journal on Selected Areas in Communications
Deploying mesh nodes under non-uniform propagation
INFOCOM'10 Proceedings of the 29th conference on Information communications
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Constrained low-interference relay node deployment for underwater acoustic wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
On the low-dimensional steiner minimum tree problem in hamming metric
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Near Optimal Bounds for Steiner Trees in the Hypercube
SIAM Journal on Computing
Applications of the linear matroid parity algorithm to approximating steiner trees
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Hypergraphic LP relaxations for steiner trees
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Fast local search for the steiner problem in graphs
Journal of Experimental Algorithmics (JEA)
Matroids and integrality gaps for hypergraphic steiner tree relaxations
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound
Operations Research Letters
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
Operations Research Letters
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
Theoretical Computer Science
Optimized relay node placement for connecting disjoint wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ESM: efficient and scalable data center multicast routing
IEEE/ACM Transactions on Networking (TON)
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic that achieves a best-known approximation ratio of $1 + \frac{\ln 3}{2} \approx 1.55$ for general graphs and best-known approximation ratios of $\approx 1.28$ for both quasi-bipartite graphs (i.e., where no two nonterminals are adjacent) and complete graphs with edge weights 1 and 2. Our method is considerably simpler and easier to implement than previous approaches. We also prove the first known nontrivial performance bound ($1.5 \cdot$ OPT) for the iterated 1-Steiner heuristic of Kahng and Robins in quasi-bipartite graphs.