User: Guest  Login
Document type:
Konferenzbeitrag 
Contribution type:
Textbeitrag / Aufsatz 
Author(s):
Brandenberg, R. and L. Roth 
Title:
New Algorithms for k-Center and Extensions 
Pages contribution:
64-78 
Abstract:
The problem of interest is covering a given point set with homothetic copies of several convex containers C1, ..., Ck, while the objective is to minimize the maximum over the dilatation factors. Such k-containment problems arise in various applications, e.g. in facility location, shape fitting, data classification or clustering. So far most attention has been paid to the special case of the Euclidean k-center problem, where all containers Ci are Euclidean unit balls. New developments based on so...    »
 
Keywords:
approximation algorithms, branch-and-bound, computational geometry, geometric inequalities, containment, core-sets, k-center diameter,, partition, SOCP, 2-SAT 
Book / Congress title:
Lecture Notes in Computer Science 5165 
Year:
2008 
Reviewed:
ja 
Language:
en 
TUM Institution:
Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik