scientific article; zbMATH DE number 2165699

MaRDI QIDQ4675629zbMATH OpenFDO

Authors Rui Pan, Daming Zhu, Shaohan Ma, Jinjie Xiao

Publication date 6 May 2005

Mathematics Subject Classification ID

Searching and sorting (68P10) Approximation algorithms (68W25)

Recommendations

• Approximation Algorithms for the k-Median Problem
• On the complexity of the local search in the p-median problem
• Complexity of local search for the \(p\)-median problem
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
• Hardness of approximation for Euclidean \(k\)-median
• A constant-factor approximation algorithm for the k-median problem
• An improved approximation algorithm for the hard uniform capacitated k-median problem
• An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
• Approximating k-median via pseudo-approximation

Cited in

(2)

• New approximability results for the robust k-median problem
• Approximation Algorithms for Aversion k-Clustering via Local k-Median

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 Q4675629)