Bounded Degree Group Steiner Tree Problems
From MaRDI portal
Publication:5041204
DOI10.1007/978-3-030-48966-3_26OpenAlexW3032785099MaRDI QIDQ5041204
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.12848
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Approximating the weight of shallow Steiner trees
- A greedy approximation algorithm for the group Steiner problem
- An improved approximation scheme for the Group Steiner Problem
- Iterative Methods in Combinatorial Optimization
- Polylogarithmic inapproximability
- Saving an epsilon
- Information Dissemination in Trees
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Online Degree-Bounded Steiner Network Design
- Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs
- Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering
- Approximation Algorithms for Directed Steiner Problems
- O (log 2 k / log log k )-approximation algorithm for directed Steiner tree
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Bounded Degree Group Steiner Tree Problems