2026-08-17T19:41:01Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1228 2024-03-06T11:07:34Z ddc:004 open_access

Approximating min-max k-clustering Levin, Asaf Approximation algorithms We consider the problems of set partitioning into $k$ clusters with minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we assume that it satisfies some natural structural constraints. That is, we assume that the cost function is monotone, the cost of a singleton is zero, and we assume that for all $S cap S' eq emptyset$ the following holds $c(S) + c(S') geq c(S cup S')$. For this problem we present a $(2k-1)$-approximation algorithm for $kgeq 3$, a 2-approximation algorithm for $k=2$, and we also show a lower bound of $k$ on the performance guarantee of any polynomial-time algorithm. We then consider special cases of this problem arising in vehicle routing problems, and present improved results. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Asaf Levin 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07261.4 urn:nbn:de:0030-drops-12282 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.4 eng https://creativecommons.org/licenses/by/4.0/legalcode