10 search results - page 1 / 2 » Greedy Optimization for Contiguity-Constrained Hierarchical ... |
ICDM
2009
IEEE
13 years 2 months ago
2009
IEEE
The discovery and construction of inherent regions in large spatial datasets is an important task for many research domains such as climate zoning, eco-region analysis, public heal...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
CSB
2005
IEEE
13 years 10 months ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
SODA
1998
ACM
13 years 5 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
EUROCAST
2009
Springer
13 years 11 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...