Pages that link to "Item:Q4651480"
From MaRDI portal
The following pages link to Local Search Heuristics for <i>k</i>-Median and Facility Location Problems (Q4651480):
Displaying 50 items.
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← 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)
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
- Approximation algorithms for spherical \(k\)-means problem using local search scheme (Q2220852) (← links)
- Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← links)
- Local search approximation algorithms for the sum of squares facility location problems (Q2274862) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Improved local search for universal facility location (Q2354309) (← links)
- Clustering with or without the approximation (Q2377383) (← links)
- A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
- Perturbation resilience for the facility location problem (Q2417105) (← links)
- Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
- Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- Incremental algorithms for facility location and \(k\)-median (Q2503354) (← links)
- On clustering with discounts (Q2671820) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- Approximating $k$-Median via Pseudo-Approximation (Q2805513) (← links)
- Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- Solving Facility Location Problem Based on Duality Approach (Q2942470) (← links)
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions (Q2958344) (← links)
- Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems (Q2971170) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- Analysis of a local search algorithm for the k-facility location problem (Q3186668) (← links)
- Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments (Q3381981) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties (Q3467834) (← links)
- A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- (Q5002778) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- (Q5075771) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- (Q5111721) (← links)
- (Q5115816) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)