The following pages link to (Q2768359):
Displayed 50 items.
- Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties) (Q260252) (← links)
- New approximation results for resource replication problems (Q270001) (← 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)
- Matroid and knapsack center problems (Q300451) (← links)
- Online network design with outliers (Q334928) (← 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)
- Mathematical programming models for determining the optimal location of beehives (Q458717) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← 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)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- A streaming algorithm for 2-center with outliers in high dimensions (Q680151) (← links)
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems (Q683730) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- Min sum clustering with penalties (Q976485) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- An improved approximation algorithm for uncapacitated facility location problem with penalties (Q1029272) (← links)
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties (Q1041733) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
- Improved approximation algorithms for multilevel facility location problems (Q1866994) (← links)
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
- Local search algorithm for the spherical \(k\)-means problem with outliers (Q2039653) (← links)
- Improved approximation for prize-collecting red-blue median (Q2043014) (← links)
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
- An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
- On the power of static assignment policies for robust facility location problems (Q2061885) (← links)
- Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search (Q2084618) (← links)
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Concave connection cost facility location and the star inventory routing problem (Q2117697) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Fair colorful \(k\)-center clustering (Q2118132) (← links)
- A cost-sharing scheme for the \(k\)-level facility location game with penalties (Q2136517) (← links)
- An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)