Approximation algorithms for access network design
From MaRDI portal
Publication:699765
DOI10.1007/s00453-002-0968-3zbMath1050.68170OpenAlexW2034457158MaRDI QIDQ699765
Lisa Zhang, Matthew T. Andrews
Publication date: 25 September 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-002-0968-3
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Approximation algorithms (68W25)
Related Items (4)
Approximating some network design problems with node costs ⋮ A branch and cut algorithm for hub location problems with single assignment ⋮ 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: Approximation algorithms for access network design
