An approximation algorithm for generalized connectivity problem on planar graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 219235 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
- A general approach to online network optimization problems
- A threshold of ln n for approximating set cover
- An 11/6-approximation algorithm for the network Steiner problem
- An O(n n) approximation scheme for Steiner tree in planar graphs
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
- Improved low-degree testing and its applications
- New approximation algorithms for the Steiner tree problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Steiner Minimal Trees
- Steiner tree approximation via iterative randomized rounding
- The Clustered Selected-Internal Steiner Tree Problem
- The bursty Steiner tree problem
- Tighter Bounds for Graph Steiner Tree Approximation
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
This page was built for publication: An approximation algorithm for generalized connectivity problem on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263308)
