On Parameterized and Kernelization Algorithms for the Hierarchical Clustering Problem
Conference Paper
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
HIERARCHICAL CLUSTERING is an important problem with wide applications. In this paper, we approach the problem with a formulation based on weighted graphs and introduce new algorithmic techniques. Our new formulation and techniques lead to new kernelization algorithms and parameterized algorithms for the problem, which significantly improve previous algorithms for the problem. Springer-Verlag Berlin Heidelberg 2013.
name of conference
Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings