Approximating directed buy-at-bulk network design

DOI10.1007/978-3-642-18318-8_2zbMATH Open1314.68212OpenAlexW1550474899MaRDI QIDQ3075445FDOQ3075445

Authors: Spyridon Antonakopoulos 

Publication date: 15 February 2011

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_2

Recommendations

• Approximation algorithms for nonuniform buy-at-bulk network design
• On non-uniform multicommodity buy-at-bulk network design
• Approximation algorithms for node-weighted buy-at-bulk network design
• Improved Approximation for Single-Sink Buy-at-Bulk
• Algorithm Theory - SWAT 2004

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Cited In (11)

• Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
• Improved approximation algorithms for directed Steiner forest
• Online Buy-at-Bulk Network Design
• On non-uniform multicommodity buy-at-bulk network design
• Approximation algorithms for node-weighted buy-at-bulk network design
• Algorithm Theory - SWAT 2004
• Approximation algorithms for nonuniform buy-at-bulk network design
• Approximation algorithms for buy-at-bulk geometric network design
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design
• Buy-at-bulk network design with protection
• A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design

This page was built for publication: Approximating directed buy-at-bulk network design

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