Algorithms for a network design problem with crossing supermodular demands
From MaRDI portal
Recommendations
- A class of network design problems with multiple demand: Model formulation and an algorithmic approach
- Approximation algorithms for multi-budgeted network design problems
- Approximation algorithms for network design problems
- Algorithms for the non-bifurcated network design problem
- Approximation Algorithms for a Network Design Problem
- Algorithms for a multi-level network optimization problem
- scientific article; zbMATH DE number 1670539
- Approximation algorithms for a capacitated network design problem
- Models and algorithms for network design problems
- Algorithms for construction of optimal and suboptimal solutions in network optimization problems
Cites work
- Biconnectivity approximations and graph carvings
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 1303557 (Why is no real title available?)
- scientific article; zbMATH DE number 1559563 (Why is no real title available?)
Cited in
(16)- Sorting out single-crossing preferences on networks
- Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
- Approximation algorithms for multi-budgeted network design problems
- Approximating Directed Weighted-Degree Constrained Networks
- Additive guarantees for degree-bounded directed network design
- On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
- scientific article; zbMATH DE number 1342141 (Why is no real title available?)
- scientific article; zbMATH DE number 1445363 (Why is no real title available?)
- Directed Network Design with Orientation Constraints
- Approximating directed weighted-degree constrained networks
- Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
- Traffic-oblivious multi-commodity flow network design
- LP-based solution methods for the asymmetric TSP
- 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
- The k-path tree matroid and its applications to survivable network design
This page was built for publication: Algorithms for a network design problem with crossing supermodular demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474300)
