Go to the corresponding LIPIcs Volume Portal 
Arutyunova, Anna ; Großwendt, Anna ; Röglin, Heiko ; Schmidt, Melanie ; Wargalla, Julian
pdfformat: 

@InProceedings{arutyunova_et_al:LIPIcs.APPROX/RANDOM.2021.18, author = {Arutyunova, Anna and Gro{\ss}wendt, Anna and R\"{o}glin, Heiko and Schmidt, Melanie and Wargalla, Julian}, title = {{Upper and Lower Bounds for Complete Linkage in General Metric Spaces}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {18:118:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772075}, ISSN = {18688969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14711}, URN = {urn:nbn:de:0030drops147115}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.18}, annote = {Keywords: Hierarchical Clustering, Complete Linkage, agglomerative Clustering, kCenter} }
Keywords:  Hierarchical Clustering, Complete Linkage, agglomerative Clustering, kCenter  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)  
Issue Date:  2021  
Date of publication:  15.09.2021 