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

zbMATH Open1162.90496MaRDI QIDQ5301764FDOQ5301764

Authors: Jurij Mihelič, Borut Robič 

Publication date: 20 January 2009

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)

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• Mathematical models and search algorithms for the capacitated \(p\)-center problem
• New algorithms for \(k\)-center and extensions
• A technique for obtaining true approximations for \(k\)-center with covering constraints
• A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
• Data exploration by representative region selection: axioms and convergence
• Heuristics for \(k\)-domination models of facility location problems in street networks
• A Best Possible Heuristic for the k-Center Problem
• Title not available (Why is that?)
• A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
• Solving \(k\)-center problems involving sets based on optimization techniques

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)