@InProceedings{ficker_et_al:LIPIcs.ISAAC.2018.45,
author = {Ficker, Annette M. C. and Erlebach, Thomas and Mihal\'{a}k, Mat\'{u}s and Spieksma, Frits C. R.},
title = {{Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {45:1--45:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.45},
URN = {urn:nbn:de:0030-drops-99933},
doi = {10.4230/LIPIcs.ISAAC.2018.45},
annote = {Keywords: approximation algorithm, matching, clustering problem}
}