Pages that link to "Item:Q3579195"

The following pages link to A new greedy approach for facility location problems (Q3579195):

Displaying 50 items.

• New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• A lower bound for metric 1-median selection (Q340556) (← links)
• Clustering through continuous facility location problems (Q346248) (← links)
• Data stability in clustering: a closer look (Q465252) (← links)
• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• A splitter location-allocation problem in designing fiber optic access networks (Q531477) (← links)
• Capacitated domination problem (Q534769) (← links)
• Multi-facility ordered median problems in directed networks (Q545449) (← links)
• Incremental facility location problem and its competitive algorithms (Q604759) (← 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)
• Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
• A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
• Center-based clustering under perturbation stability (Q763489) (← links)
• A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
• Partial multicuts in trees (Q861281) (← links)
• Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
• Recovery guarantees for exemplar-based clustering (Q897656) (← links)
• A primal-dual algorithm for online non-uniform facility location (Q924552) (← links)
• Approximation algorithm for facility location with service installation costs (Q924885) (← links)
• Kinetic facility location (Q970606) (← links)
• Randomized priority algorithms (Q974749) (← links)
• A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
• The reverse greedy algorithm for the metric k-median problem (Q1045901) (← links)
• A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
• Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
• An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
• Probably certifiably correct \(k\)-means clustering (Q1675259) (← links)
• A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
• Improved approximation algorithms for multilevel facility location problems (Q1866994) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
• Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
• Near-optimal clustering in the \(k\)-machine model (Q2062125) (← links)
• An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
• The distance-constrained matroid median problem (Q2182102) (← links)
• Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
• Robust fault tolerant uncapacitated facility location (Q2250439) (← links)
• Approximating soft-capacitated facility location problem with uncertainty (Q2251144) (← links)
• Soft-capacitated facility location game (Q2267278) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• Improved approximation algorithms for constrained fault-tolerant resource allocation (Q2348043) (← links)
• Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)