Approximation algorithms for access network design

DOI10.1007/S00453-002-0968-3MaRDI QIDQ699765zbMATH OpenOpenAlexFDO

Authors Lisa Zhang, Matthew 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

zbMATH Keywords

integer program

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Integer programming (90C10) Traffic problems in operations research (90B20)

Recommendations

• scientific article; zbMATH DE number 1003253
• scientific article; zbMATH DE number 1003254
• Approximation algorithms for nonuniform buy-at-bulk network design
• scientific article; zbMATH DE number 1532274
• Simpler and better approximation algorithms for network design

Cited in

(8)

• A branch and cut algorithm for hub location problems with single assignment
• Approximation algorithms for data management in networks
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
• Traffic-redundancy aware network design
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
• An improved approximation algorithm for virtual private network design
• Trunk Implementation Plan for Hierarchical Networks
• Approximating some network design problems with node costs

This page was built for publication: Approximation algorithms for access network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q699765)