Computing sharp bounds for hard clustering problems on trees

Clustering problems with relational constraints in which the underlying graph is a tree arise in a variety of applications: hierarchical data base paging, communication and distribution networks, districting, biological taxonomy, and others. They are formulated here as optimal tree partitioning prob...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 157; no. 5; pp. 991 - 1008
Main Authors:	Lari, Isabella, Maravalle, Maurizio, Simeone, Bruno
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier B.V 06.03.2009 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computational complexity Computer science; control theory; systems Contiguity-constrained clustering Exact sciences and technology Graph theory Heuristics Integer programming Linear programming Mathematics Sciences and techniques of general use Theoretical computing Trees Trees Integer programming Contiguity-constrained clustering Linear programming Computational complexity Heuristics Tree(graph) Taxonomy Computing Optimization Relaxation Database Distribution function Combinatorics Data communication Partition Computer theory Paging Communication network Integer Experimental result Distribution Objective function Application Variety
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!