Approximability of robust network design

MaRDI QIDQ5417693zbMATH OpenFDO

Authors Neil Olver, F. Bruce Shepherd

Publication date 22 May 2014

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Approximability of robust network design
• On the approximability of robust network design
• Exploring the tractability of the capped hose model
• Hardness of robust network design
• From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk

Cited in

(17)

• A robustness approach to uncapacitated network design problems
• A note on hierarchical hubbing for a generalization of the VPN problem
• On the approximability of robust network design
• Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
• An approach to robust network design in telecommunications
• Hardness of robust network design
• Robust path choice in networks with failures
• Robust Two-Stage Network Problems
• Stochastic control liaisons. Richard Sinkhorn meets Gaspard Monge on a Schrödinger bridge
• Exploring the tractability of the capped hose model
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• Approximability of robust network design
• Non-uniform robust network design in planar graphs
• Additive Approximation for Bounded Degree Survivable Network Design
• Virtual private network design over the first Chvátal closure
• Networks and the best approximation property
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard

This page was built for publication: Approximability of robust network design

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