Approximation algorithms for node-weighted buy-at-bulk network design
From MaRDI portal
Publication:2934722
zbMATH Open1302.90028MaRDI QIDQ2934722FDOQ2934722
Authors: Chandra Chekuri, Mohammad Salavatipour, Mohammad T. Hajiaghayi, Guy Kortsarz 
Publication date: 18 December 2014
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25) Flows in graphs (05C21) Network design and communication in computer systems (68M10)
Cited In (21)
- Approximation algorithms for orienting mixed graphs
- Competitive Cost Sharing with Economies of Scale
- One tree suffices: a simultaneous \(O(1)\)-approximation for single-sink buy-at-bulk
- Oblivious buy-at-bulk in planar graphs
- Online Buy-at-Bulk Network Design
- On non-uniform multicommodity buy-at-bulk network design
- Competitive cost sharing with economies of scale
- Algorithm Theory - SWAT 2004
- Approximation algorithms for nonuniform buy-at-bulk network design
- Approximating directed buy-at-bulk network design
- Improved Approximation for Single-Sink Buy-at-Bulk
- Approximability of capacitated network design
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
- Approximating Steiner Networks with Node Weights
- Approximating some network design problems with node costs
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- Buy-at-bulk network design with protection
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
This page was built for publication: Approximation algorithms for node-weighted buy-at-bulk network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934722)
