The following pages link to (Q2934585):
Displayed 11 items.
- 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 priority facility location problem with penalties (Q905151) (← links)
- Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
- A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
- Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties (Q6117321) (← links)
- (Q6188291) (← links)