Approximation algorithms for access network design

DOI10.1007/S00453-002-0968-3zbMATH Open1050.68170OpenAlexW2034457158MaRDI QIDQ699765FDOQ699765

Matthew Andrews, Lisa Zhang

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)

Cited In (7)

• 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
• A branch and cut algorithm for hub location problems with single assignment
• Approximating some network design problems with node costs
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
• Approximation algorithms for data management in networks

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximation algorithms for nonuniform buy-at-bulk network design 👍 👎
• Title not available (Why is that?) 👍 👎
• Simpler and better approximation algorithms for network design 👍 👎

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)