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):
Displayed 42 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- A lower bound for metric 1-median selection (Q340556) (← links)
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Data stability in clustering: a closer look (Q465252) (← links)
- LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Capacitated domination problem (Q534769) (← links)
- On min-max \(r\)-gatherings (Q627109) (← links)
- Better bounds for incremental medians (Q627114) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Recovery guarantees for exemplar-based clustering (Q897656) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- An approximation ratio for biclustering (Q975394) (← links)
- Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Mobile facility location: combinatorial filtering via weighted occupancy (Q2251136) (← 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)
- Incremental medians via online bidding (Q2482726) (← links)
- Incremental algorithms for facility location and \(k\)-median (Q2503354) (← 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)
- 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)
- 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)
- Sublinear-time Algorithms (Q4933363) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- Capacitated Domination Problem (Q5387762) (← links)
- Prolong the Lifetime of Wireless Sensor Networks Through Mobility: A General Optimization Framework (Q5391130) (← links)
- On Min-Max r-Gatherings (Q5443378) (← links)
- Better Bounds for Incremental Medians (Q5443384) (← links)