The following pages link to (Q3579459):
Displayed 14 items.
- Approximate robust optimization for the connected facility location problem (Q299099) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- Contention-aware data caching in wireless multi-hop ad hoc networks (Q635358) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Securely Connected Facility Location in Metric Graphs (Q5232830) (← links)
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)