Combination algorithms for Steiner tree variants
From MaRDI portal
Publication:2700384
DOI10.1007/s00453-022-01009-8OpenAlexW4290613789MaRDI QIDQ2700384
Gruia Călinescu, Xiaolang Wang
Publication date: 21 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01009-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- On better heuristics for Steiner minimum trees
- Wireless network design via 3-decompositions
- Matching theory
- A fast algorithm for Steiner trees
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- Approximating Steiner trees and forests with minimum number of Steiner points
- An analysis of the greedy algorithm for the submodular set covering problem
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- An 11/6-approximation algorithm for the network Steiner problem
- A greedy approximation algorithm for the group Steiner problem
- On Min-Power Steiner Tree
- Random pseudo-polynomial algorithms for exact matroid problems
- Improved Approximations for the Steiner Tree Problem
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- Thek-Steiner Ratio in Graphs
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- On minimal graphs containing $n$ given points
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Approximation Algorithms for Directed Steiner Problems
- Reducibility among Combinatorial Problems
- A Weighted Linear Matroid Parity Algorithm
- Tighter Bounds for Graph Steiner Tree Approximation
- Steiner Tree Approximation via Iterative Randomized Rounding
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
- Steiner's problem in graphs and its implications
- The steiner problem in graphs
- Approximations for Steiner trees with minimum number of Steiner points
This page was built for publication: Combination algorithms for Steiner tree variants
