Publication:2768299
From MaRDI portal
zbMath1015.90009MaRDI QIDQ2768299
Sanjeev Khanna, Joseph (Seffi) Naor, Chandra Chekuri
Publication date: 29 July 2003
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
68W25: Approximation algorithms
Related Items
Online Buy-at-Bulk Network Design, Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph, On the complexity of the cable-trench problem, Improved approximation algorithms for directed Steiner forest, LP-based approximation algorithms for facility location in buy-at-bulk network design, Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees, Online covering with \(\ell_q\)-norm objectives and applications to network design, LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design