Pages that link to "Item:Q1016041"
From MaRDI portal
The following pages link to Approximation algorithms for connected facility location problems (Q1016041):
Displaying 22 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- The online multicommodity connected facility location problem (Q1644930) (← links)
- The connected facility location polytope (Q1686059) (← links)
- Primal-dual algorithms for connected facility location problems (Q1884770) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- An efficient approximation algorithm for the extension facility location problem on torus internetwork topology (Q2224275) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract) (Q2958334) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- On the Asymmetric Connected Facility Location Polytope (Q3195346) (← links)
- (Q4411292) (← links)
- Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts (Q5369503) (← links)
- Construction Line Algorithms for the Connection Location-Allocation Problem (Q5391943) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)