Polynomial time approximation schemes for clustering in low highway dimension graphs
From MaRDI portal
Publication:5874516
Recommendations
- Polynomial time approximation schemes for clustering in low highway dimension graphs
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Fixed parameter approximations for \(k\)-center problems in low highway dimension graphs
- Travelling on graphs with small highway dimension
Cites work
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Bypassing the embedding
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- Hierarchy of Transportation Network Parameters and Hardness Results
- Highway dimension, shortest paths, and provably efficient algorithms
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Local search yields a PTAS for \(k\)-means in doubling metrics
- The hardness of approximation of Euclidean \(k\)-means
- Travelling on graphs with small highway dimension
Cited in
(3)
This page was built for publication: Polynomial time approximation schemes for clustering in low highway dimension graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874516)
