Approximating min-max k-clustering

Author Asaf Levin



PDF
Thumbnail PDF

File

DagSemProc.07261.4.pdf
  • Filesize: 92 kB
  • 5 pages

Document Identifiers

Author Details

Asaf Levin

Cite As Get BibTex

Asaf Levin. Approximating min-max k-clustering. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/DagSemProc.07261.4

Abstract

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.

Subject Classification

Keywords
  • Approximation algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail