scientific article
From MaRDI portal
Publication:2768299
zbMath1015.90009MaRDI QIDQ2768299
Sanjeev Khanna, Joseph (Seffi) Naor, Chandra Chekuri
Publication date: 29 July 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items (8)
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design ⋮ Online Buy-at-Bulk Network Design ⋮ On the complexity of the cable-trench problem ⋮ Improved approximation algorithms for directed Steiner forest ⋮ 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 ⋮ Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph ⋮ Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
This page was built for publication:
