Approximation algorithms for network design problems
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Applications of design theory to circuits and networks (94C30)
Recommendations
Cited in
(13)- Approximation algorithms for data management in networks
- Approximation algorithms for a capacitated network design problem
- Algorithms for the non-bifurcated network design problem
- Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm
- A 2-approximation algorithm for the network substitution problem
- An improved approximation algorithm for virtual private network design
- Complexity and Approximation of the Continuous Network Design Problem
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Algorithms for a network design problem with crossing supermodular demands
- Algorithms and extended formulations for one and two facility network design
- Deterministic sampling algorithms for network design
- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
This page was built for publication: Approximation algorithms for network design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920753)
