Approximation algorithms for a directed network design problem
From MaRDI portal
Recommendations
- Algorithms for a network design problem with crossing supermodular demands
- scientific article; zbMATH DE number 1445363
- Directed Network Design with Orientation Constraints
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
- On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
Cited in
(12)- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- Approximation algorithms for a capacitated network design problem
- Algorithms for the non-bifurcated network design problem
- Primal-dual-based algorithms for a directed network design problem
- An exact algorithm for the min-cost network containment problem
- Approximation Algorithms for Network Design Problems on Bounded Subsets
- scientific article; zbMATH DE number 1445363 (Why is no real title available?)
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
- Directed Network Design with Orientation Constraints
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
- An approximation algorithm for network design problems with downwards-monotone demand functions
This page was built for publication: Approximation algorithms for a directed network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263723)
