Network design via core detouring for problems without a core

DOI10.1007/978-3-642-14165-2_42MaRDI QIDQ3587402zbMATH OpenOpenAlexFDO

Authors Fabrizio Grandoni, Thomas Rothvoß

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14165-2_42

zbMATH Keywords

approximation algorithmsnetwork designvirtual private networkrent-or-buybuy-at-bulkcore detouring

Mathematics Subject Classification ID

Approximation algorithms (68W25) Network design and communication in computer systems (68M10)

Recommendations

• Connected facility location via random facility sampling and core detouring
• Simpler and better approximation algorithms for network design
• Deterministic Sampling Algorithms for Network Design
• Deterministic sampling algorithms for network design
• Approximation via cost sharing

Cited in

(11)

• Competitive and deterministic embeddings of virtual networks
• Oblivious buy-at-bulk in planar graphs
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
• Exact approaches for designing multifacility buy-at-bulk networks
• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
• Approximation algorithms for a combined facility location buy-at-bulk network design problem
• Deterministic Sampling Algorithms for Network Design
• An improved approximation algorithm for the uniform cost-distance Steiner tree problem
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• LP-based approximation algorithms for facility location in buy-at-bulk network design
• LP-based approximation algorithms for facility location in buy-at-bulk network design

This page was built for publication: Network design via core detouring for problems without a core

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