The following pages link to (Q2921761):
Displaying 26 items.
- 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)
- 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)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← 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)
- Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
- The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem (Q3453284) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties (Q4639927) (← links)
- (Q5009516) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
- (Q5743493) (← links)
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties (Q6117321) (← links)
- A combinatorial approximation algorithm for \(k\)-level facility location problem with submodular penalties (Q6176404) (← links)
