首页> 外文OA文献 >Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

【2h】

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

机译：用基于聚类的（元）启发式方法求解欧氏有界直径最小生成树问题

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Martin Gruber; Günther R. Raidl;
展开▼
作者单位

展开▼
年度 2012
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem [J] . C. Patvardhan, V. Prem Prakash, A. Srivastav Informatica: An International Journal of Computing and Informatics . 2015,第3期

机译：欧氏有界直径最小生成树问题大实例的快速启发式
2. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem [J] . C. Patvardhan, V. Prem Prakash, A. Srivastav Informatica: An International Journal of Computing and Informatics . 2015,第3期

机译：欧氏有界直径最小生成树问题大实例的快速启发式
3. Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem [J] . C. Patvardhan, V. Prem Prakash, A. Srivastav Informatica: An International Journal of Computing and Informatics . 2015,第3期

机译：欧氏有界直径最小生成树问题大实例的快速启发式
4. Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-) Heuristics [C] . Martin Gruber, Guenther R. Raidl Computer aided systems theory-EUROCAST 2009 . 2009

机译：通过基于聚类（元）的启发式方法求解欧氏有界直径最小生成树问题
5. Computing a diameter-constrained minimum spanning tree. [D] . Abdalla, Ayman Mahmoud. 2001

机译：计算直径受限的最小生成树。
6. Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes [O] . Shannon C. Wieland, John S. Brownstein, Bonnie Berger, 2007

机译：密度均衡的欧几里得最小生成树用于检测所有疾病簇的形状
7. Exploiting Hierarchical Clustering for Finding Bounded Diameter Minimum Spanning Trees on Euclidean Instances [O] . Martin Gruber, Günther R. Raidl 2012

机译：利用层次聚类在欧氏实例中寻找有界直径最小生成树

Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics

著录项

引文网络

相似文献

相关主题

期刊订阅