Approximation algorithms for priority Steiner tree problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- scientific article; zbMATH DE number 7651143 (Why is no real title available?)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A threshold of ln n for approximating set cover
- Analytical approach to parallel repetition
- Approximation algorithms for nonuniform buy-at-bulk network design
- Dynamic Steiner Tree Problem
- Grade of service Steiner minimum trees in the Euclidean plane
- Improved approximation algorithms for the quality of service multicast tree problem
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
- On the approximability of some network design problems
- Online Priority Steiner Tree Problems
- Online node-weighted Steiner tree and related problems
- Steiner tree approximation via iterative randomized rounding
- The Multi-Tier Tree Problem
- The Steiner tree problem on graphs: inapproximability results
- The hierarchical network design problem
- O(^2 k/ k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm
This page was built for publication: Approximation algorithms for priority Steiner tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695278)
