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.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||10th International Conference on Theory and Applications of Models of Computation, TAMC 2013|
|Period||20/05/13 → 22/05/13|
- Theoretical Computer Science
- Computer Science(all)