Pages that link to "Item:Q5900928"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900928):
Displayed 12 items.
- A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
- A splitter location-allocation problem in designing fiber optic access networks (Q531477) (← links)
- On min-max \(r\)-gatherings (Q627109) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
- Approximating soft-capacitated facility location problem with uncertainty (Q2251144) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- The approximation gap for the metric facility location problem is not yet closed (Q2467481) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
- On Min-Max r-Gatherings (Q5443378) (← links)