New Approaches for Virtual Private Network Design

DOI10.1137/060654827MaRDI QIDQ3507517zbMATH OpenOpenAlexFDO

Authors Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella

Publication date 19 June 2008

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://infoscience.epfl.ch/record/121643/files/siam_comput.pdf

zbMATH Keywords

approximation algorithmsnetwork designrandomized algorithms

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• An improved approximation algorithm for virtual private network design
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Virtual private network design
• From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk

Cited in

(10)

• Connected facility location via random facility sampling and core detouring
• On the approximability of robust network design
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• Exploring the tractability of the capped hose model
• Approximability of robust network design
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Deterministic sampling algorithms for network design
• Virtual private network design over the first Chvátal closure
• Automata, Languages and Programming

This page was built for publication: New Approaches for Virtual Private Network Design

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