A greedy approximation algorithm for the group Steiner problem
From MaRDI portal
Publication:2581556
Recommendations
Cites work
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A threshold of ln n for approximating set cover
- A tight bound on approximating arbitrary metrics by tree metrics
- An improved approximation scheme for the Group Steiner Problem
- Approximating min-sum k -clustering in metric spaces
- Approximating the weight of shallow Steiner trees
- Approximation Algorithms for Directed Steiner Problems
- Approximation algorithms for the covering Steiner problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079350 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- scientific article; zbMATH DE number 2119643 (Why is no real title available?)
- scientific article; zbMATH DE number 2119644 (Why is no real title available?)
- scientific article; zbMATH DE number 1445321 (Why is no real title available?)
- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
- Polylogarithmic inapproximability
- The Steiner problem with edge lengths 1 and 2
Cited in
(27)- Combinatorial optimization in system configuration design
- Solving group Steiner problems as Steiner problems.
- Tour recommendation for groups
- On a class of branching problems in broadcasting and distribution
- Affinity-driven blog cascade analysis and prediction
- Approximating the two-level facility location problem via a quasi-greedy approach
- Some formulations for the group Steiner tree problem
- The polymatroid Steiner problems
- On fixed cost k-flow problems
- Combination algorithms for Steiner tree variants
- An improved approximation scheme for the Group Steiner Problem
- Approximating fault-tolerant group-Steiner problems
- An FPTAS for the fractional group Steiner tree problem
- scientific article; zbMATH DE number 139784 (Why is no real title available?)
- Improved approximation algorithms for directed Steiner forest
- scientific article; zbMATH DE number 1303564 (Why is no real title available?)
- scientific article; zbMATH DE number 2079350 (Why is no real title available?)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- scientific article; zbMATH DE number 2119643 (Why is no real title available?)
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Bounded Degree Group Steiner Tree Problems
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- From directed Steiner tree to directed polymatroid Steiner tree in planar graphs
This page was built for publication: A greedy approximation algorithm for the group Steiner problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581556)
