Online Node-weighted Steiner Forest and Extensions via Disk Paintings
From MaRDI portal
Publication:5737814
Recommendations
- Online node-weighted Steiner tree and related problems
- An optimal algorithm for online prize-collecting node-weighted Steiner forest
- Online Directed Spanners and Steiner Forests.
- scientific article; zbMATH DE number 1559550
- Parameterized analysis of the online priority and node-weighted Steiner tree problems
- On-line Steiner trees in the Euclidean plane
- Online Steiner tree with deletions
- Non-greedy online Steiner trees on outerplanar graphs
- Non-greedy online Steiner trees on outerplanar graphs
- Node-weighted Steiner tree approximation in unit disk graphs
Cites work
- scientific article; zbMATH DE number 1953187 (Why is no real title available?)
- scientific article; zbMATH DE number 1559550 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A general approach to online network optimization problems
- An \(O(\log n)\)-competitive algorithm for online constrained forest problems
- Approximating Steiner networks with node-weights
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Approximation Algorithms for Directed Steiner Problems
- Dynamic Steiner Tree Problem
- Efficient recovery from power outage (extended abstract)
- Heuristics for the fixed cost median problem
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Lower bound of the Hadwiger number of graphs by their average degree
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
- Node-weighted network design in planar and minor-closed families of graphs
- On-line generalized Steiner problem
- Online node-weighted Steiner tree and related problems
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- The online set cover problem
- The point-to-point delivery and connection problems: Complexity and algorithms
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(10)- Online constrained forest and prize-collecting network design
- Tight bounds for online weighted tree augmentation
- Online Buy-at-Bulk Network Design
- Parameterized analysis of the online priority and node-weighted Steiner tree problems
- Online weighted degree-bounded Steiner networks via novel online mixed packing/covering
- An optimal algorithm for online prize-collecting node-weighted Steiner forest
- Spider covering algorithms for network design problems
- Online node-weighted Steiner tree and related problems
- Online Spanners in Metric Spaces
- Timing matters: online dynamics in broadcast games
This page was built for publication: Online Node-weighted Steiner Forest and Extensions via Disk Paintings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5737814)
