Approximation algorithms for node-weighted directed Steiner problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- scientific article; zbMATH DE number 2209521 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- An LMP O( n)-approximation algorithm for node weighted prize collecting Steiner tree
- Approximating some network design problems with node costs
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Approximation Algorithms for Directed Steiner Problems
- Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Budgeted out-tree maximization with submodular prizes
- Efficient recovery from power outage (extended abstract)
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- Lasserre integrality gaps for graph spanners and related problems
- Linear Programming Hierarchies Suffice for Directed Steiner Tree
- More algorithms for all-pairs shortest paths in weighted graphs
- Polynomial integrality gap of flow LP for directed Steiner tree
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- 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 node-weighted directed Steiner problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021090)
