Tight bounds for online weighted tree augmentation
From MaRDI portal
Publication:5091248
Recommendations
- Tight bounds for online weighted tree augmentation
- scientific article; zbMATH DE number 6850362
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Online node-weighted Steiner tree and related problems
Cites work
- A data structure for dynamic trees
- Approximation Algorithms for Several Graph Augmentation Problems
- Dynamic Steiner Tree Problem
- Greedy algorithms for online survivable network design
- Hitting sets online and unique-MAX coloring
- scientific article; zbMATH DE number 1559550 (Why is no real title available?)
- Improved approximation for tree augmentation: saving by rewiring
- Near-optimal online algorithms for prize-collecting Steiner problems
- On-line generalized Steiner problem
- Online and Stochastic Survivable Network Design
- Online constrained forest and prize-collecting network design
- Online network design algorithms via hierarchical decompositions
- Online node-weighted Steiner tree and related problems
- The online set cover problem
Cited in
(5)- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- Beating approximation factor two for weighted tree augmentation with bounded costs
- The Steiner path aggregation problem
- Tight bounds for online weighted tree augmentation
This page was built for publication: Tight bounds for online weighted tree augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091248)
