Approximation Algorithms for a Network Design Problem
From MaRDI portal
(Redirected from Publication:5323067)
Recommendations
Cites work
- A greedy heuristic for a minimum-weight forest problem
- A matching problem with side conditions
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A primal-dual approximation algorithm for generalized Steiner network problems
- An approximation algorithm for network design problems with downwards-monotone demand functions
- Approximating minimum-cost graph problems with spanning tree edges
- scientific article; zbMATH DE number 742977 (Why is no real title available?)
Cited in
(11)- Approximation algorithms for data management in networks
- Approximation algorithms for a capacitated network design problem
- Algorithms for the non-bifurcated network design problem
- A 2-approximation algorithm for the network substitution problem
- Complexity and Approximation of the Continuous Network Design Problem
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- Monotone covering problems with an additional covering constraint
- scientific article; zbMATH DE number 1163719 (Why is no real title available?)
- Algorithms for a network design problem with crossing supermodular demands
- scientific article; zbMATH DE number 3997723 (Why is no real title available?)
- An approximation algorithm for network design problems with downwards-monotone demand functions
This page was built for publication: Approximation Algorithms for a Network Design Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323067)