scientific article; zbMATH DE number 1303564
From MaRDI portal
Publication:4250189
Recommendations
Cited in
(32)- Approximation algorithms for group prize-collecting and location-routing problems
- The minimum degree group Steiner problem
- On the clustered Steiner tree problem
- Meet and merge: approximation algorithms for confluent flows
- Some formulations for the group Steiner tree problem
- A greedy approximation algorithm for the group Steiner problem
- Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)
- An improved approximation scheme for the Group Steiner Problem
- Balls and funnels: energy efficient group-to-group anycasts
- On the clustered Steiner tree problem
- Steiner problems with limited number of branching nodes
- Approximating fault-tolerant group-Steiner problems
- An FPTAS for the fractional group Steiner tree problem
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- Approximation algorithm for the group Steiner network problem
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
- On the approximability of dense Steiner problems
- scientific article; zbMATH DE number 139784 (Why is no real title available?)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Approximation algorithms for the covering Steiner problem
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs
- scientific article; zbMATH DE number 2119643 (Why is no real title available?)
- scientific article; zbMATH DE number 1445321 (Why is no real title available?)
- Node-weighted Steiner tree and group Steiner tree in planar graphs
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- Algorithms and Computation
- A tight bound on approximating arbitrary metrics by tree metrics
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- A PTAS for TSP with neighbourhoods over parallel line segments
- Approximating fault-tolerant group-Steiner problems
- Budget constrained minimum cost connected medians
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250189)
