Online Buy-at-Bulk Network Design
From MaRDI portal
Publication:4577806
DOI10.1137/16M1117317zbMath1396.68135arXiv1509.03212OpenAlexW2883318249MaRDI QIDQ4577806
Ravishankar Krishnaswamy, Alina Ene, Deeparnab Chakrabarty, Debmalya Panigrahi
Publication date: 3 August 2018
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.03212
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Timing matters: online dynamics in broadcast games ⋮ Online covering with \(\ell_q\)-norm objectives and applications to network design ⋮ Spider Covering Algorithms for Network Design Problems ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved approximation algorithms for directed Steiner forest
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- Approximation algorithms for spanner problems and directed Steiner forest
- Approximating the Single-Sink Link-Installation Problem in Network Design
- An improved approximation scheme for the Group Steiner Problem
- Design networks with bounded pairwise distance
- A general approach to online network optimization problems
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
- Approximating Directed Buy-at-Bulk Network Design
- Online Primal-Dual Algorithms for Covering and Packing
- Set connectivity problems in undirected graphs and the directed steiner network problem
- Cost-Distance: Two Metric Network Design
- The Online Set Cover Problem
- Simpler and better approximation algorithms for network design
- On non-uniform multicommodity buy-at-bulk network design
- A Constant Factor Approximation for the Single Sink Edge Installation Problem
- Dynamic Steiner Tree Problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Approximation Algorithms for Directed Steiner Problems
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
- Online Node-Weighted Steiner Tree and Related Problems
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- Online Mixed Packing and Covering
This page was built for publication: Online Buy-at-Bulk Network Design
