Pages that link to "Item:Q1041733"
From MaRDI portal
The following pages link to An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733):
Displayed 23 items.
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
- An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
- A cost-sharing method for an uncapacitated facility location game with penalties (Q488891) (← links)
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- An improved approximation algorithm for uncapacitated facility location problem with penalties (Q1029272) (← links)
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
- Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
- Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
- Improved approximation algorithm for universal facility location problem with linear penalties (Q2424885) (← links)
- A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
- Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties (Q3467835) (← links)
- An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties (Q3628452) (← links)
- Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
- A per-scenario bound for the two-stage stochastic facility location problem with linear penalty (Q5169466) (← links)
- Approximation algorithms for prize-collecting capacitated network design problems (Q6111480) (← links)
- (Q6188291) (← links)