Approximation algorithms for the k-center problem: an experimental evaluation

MaRDI QIDQ5301764zbMATH OpenFDO

Authors Jurij Mihelič, Borut Robič

Publication date 20 January 2009

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Best Possible Heuristic for the k-Center Problem
• scientific article; zbMATH DE number 1303609
• Exact and approximation algorithms for clustering
• Fault tolerant \(K\)-center problems
• The capacitated K-center problem (extended abstract)

Cited in

(13)

• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
• A technique for obtaining true approximations for \(k\)-center with covering constraints
• Solving \(k\)-center problems involving sets based on optimization techniques
• Heuristics for \(k\)-domination models of facility location problems in street networks
• Tight FPT approximation for constrained k-center and k-supplier
• scientific article; zbMATH DE number 2089224 (Why is no real title available?)
• Mathematical models and search algorithms for the capacitated p-center problem
• A Best Possible Heuristic for the k-Center Problem
• scientific article; zbMATH DE number 1754597 (Why is no real title available?)
• A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
• Data exploration by representative region selection: axioms and convergence
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
• New algorithms for \(k\)-center and extensions

This page was built for publication: Approximation algorithms for the \(k\)-center problem: an experimental evaluation

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