The following pages link to David Saulpic (Q2229950):
Displaying 8 items.
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics (Q5056433) (← links)
- (Q5090485) (← links)
- A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs (Q5111697) (← links)
- (Q5874516) (← links)
- Experimental evaluation of fully dynamic \(k\)-means via coresets (Q6545403) (← links)
- An improved local search algorithm for \(k\)-median (Q6575139) (← links)
