scientific article; zbMATH DE number 1559550

zbMath0963.68152MaRDI QIDQ4527000

Chris Coulston, Piotr Berman

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generalized Steiner tree problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (31)

Tight bounds for online weighted tree augmentation ⋮ On-line generalized Steiner problem ⋮ Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem ⋮ Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing ⋮ Online Priority Steiner Tree Problems ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Towards Flexible Demands in Online Leasing Problems ⋮ Non-greedy online Steiner trees on outerplanar graphs ⋮ Online Buy-at-Bulk Network Design ⋮ Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks ⋮ Thresholded covering algorithms for robust and max-min optimization ⋮ Timing matters: online dynamics in broadcast games ⋮ Unnamed Item ⋮ Online Spanners in Metric Spaces ⋮ Non-greedy Online Steiner Trees on Outerplanar Graphs ⋮ A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Approximability of Capacitated Network Design ⋮ An O(logn)-Competitive Algorithm for Online Constrained Forest Problems ⋮ Concurrent multicast in weighted networks ⋮ Online constrained forest and prize-collecting network design ⋮ Online Node-weighted Steiner Forest and Extensions via Disk Paintings ⋮ Concurrent multicast in weighted networks ⋮ The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem ⋮ Equilibria in Online Games ⋮ The Power of Recourse for Online MST and TSP ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Tight Bounds for Online Weighted Tree Augmentation ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems ⋮ Approximability of capacitated network design

This page was built for publication: