scientific article; zbMATH DE number 7651185
From MaRDI portal
Publication:5874516
DOI10.4230/LIPIcs.ESA.2020.46MaRDI QIDQ5874516
David Saulpic, Andreas Emil Feldmann
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Polynomial time approximation schemes for clustering in low highway dimension graphs ⋮ Travelling on graphs with small highway dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- Bypassing the embedding
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Hierarchy of Transportation Network Parameters and Hardness Results
- Travelling on graphs with small highway dimension
This page was built for publication:
