Pages that link to "Item:Q4512576"
From MaRDI portal
The following pages link to Analysis of a Local Search Heuristic for Facility Location Problems (Q4512576):
Displaying 20 items.
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties (Q3467835) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
- Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- (Q5002778) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- Constant factor approximation algorithm for uniform hard capacitated knapsack median problem (Q5090959) (← links)
- (Q5111721) (← links)
- Local search heuristic for k-median and facility location problems (Q5175949) (← links)
- The capacitated facility location problem with random input data (Q5264758) (← links)
- Capacitated Domination Problem (Q5387762) (← links)
- On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem (Q5443801) (← links)
- (Q5874473) (← links)
- (Q6065419) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
- Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center (Q6107886) (← links)
- Robust facility location in reverse logistics (Q6115584) (← links)
- Improved lower bound for differentially private facility location (Q6602319) (← links)
- Airports and railways with unsplittable demand (Q6663529) (← links)
