The following pages link to (Q4542527):
Displayed 10 items.
- A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
- Facility location models for distribution system design (Q707128) (← 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 the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← 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)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)