scientific article; zbMATH DE number 7651185

DOI10.4230/LIPICS.ESA.2020.46MaRDI QIDQ5874516FDOQ5874516

David Saulpic, Andreas Emil Feldmann

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

clusteringapproximation schemehighway dimension

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• A 1.488 approximation algorithm for the uncapacitated facility location problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
• A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
• Title not available (Why is that?)
• Bypassing the embedding
• Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics
• Hierarchy of Transportation Network Parameters and Hardness Results
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• Travelling on graphs with small highway dimension

Cited In (3)

• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Polynomial time approximation schemes for clustering in low highway dimension graphs
• Travelling on graphs with small highway dimension

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874516)