The following pages link to (Q4542527):
Displayed 29 items.
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- Clustering through continuous facility location problems (Q346248) (← links)
- Data stability in clustering: a closer look (Q465252) (← links)
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Incremental facility location problem and its competitive algorithms (Q604759) (← links)
- Clustering and the perturbed spatial median (Q611736) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Facility location models for distribution system design (Q707128) (← 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)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre (Q1348705) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Clustering with or without the approximation (Q2377383) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)
- An Approximation Algorithm for the Continuous <i>k</i>-Medians Problem in a Convex Polygon (Q2962556) (← links)
- An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem (Q3004653) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
- The two‐median problem on Manhattan meshes (Q3442865) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)