User: Guest  Login
Document type:
Zeitschriftenaufsatz 
Author(s):
Brandenberg, R. and L. Roth 
Title:
New algorithms for k-center and extensions 
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. Recent developments based on so-...    »
 
Keywords:
Approximation algorithms, Branch-and-bound, Computational geometry, Geometric inequalities, Containment, Core-sets, k-center, Diameter partition, SOCP, 2-SAT 
Journal title:
Journal of Combinatorial Optimization 
Year:
2009 
Journal issue:
18 
Pages contribution:
376-392 
Reviewed:
ja 
Language:
en 
Date of publication:
21.05.2009 
TUM Institution:
Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik