Pages that link to "Item:Q2354026"
From MaRDI portal
The following pages link to Approximability of capacitated network design (Q2354026):
Displaying 19 items.
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- A characterization of the uncapacitated network design polytope (Q1200785) (← links)
- Feasibility in capacitated networks: The effect of individual arcs and nodes (Q1380444) (← links)
- Approximation algorithms for a capacitated network design problem (Q1879243) (← links)
- Improved approximation for fractionally subadditive network design (Q2011025) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- Optimal design of capacitated production networks (Q2443400) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q2969620) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- (Q5077149) (← links)
- A polyhedral study of the capacity formulation of the multilayer network design problem (Q5326800) (← links)
- Algorithms – ESA 2005 (Q5475818) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- Robust \(k\)-center with two types of radii (Q5918429) (← links)
- Robust \(k\)-center with two types of radii (Q5925649) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)
- Approximation algorithm for prize-collecting vertex cover with fairness constraints (Q6646739) (← links)
