Pages that link to "Item:Q4925246"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty (Q4925246):
Displayed 10 items.
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- Approximation algorithms for the transportation problem with market choice and related models (Q1785305) (← links)
- Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
