Network Design via Core Detouring for Problems without a Core

DOI10.1007/978-3-642-14165-2_42zbMath1288.68013OpenAlexW1511618541MaRDI QIDQ3587402

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

network designapproximation algorithmsvirtual private networkrent-or-buybuy-at-bulkcore detouring

Mathematics Subject Classification ID

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

Related Items (10)

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design ⋮ Combinatorial approximation algorithms for buy-at-bulk connected facility location problems ⋮ Competitive and deterministic embeddings of virtual networks ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ LP-based approximation algorithms for facility location in buy-at-bulk network design ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem ⋮ A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ Oblivious Buy-at-Bulk in Planar Graphs ⋮ An improved approximation algorithm for the uniform cost-distance Steiner tree problem

This page was built for publication: Network Design via Core Detouring for Problems without a Core