.png){kind=icon}
返回
An O(mn) algorithm for the anti-cent-dian problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.05.088.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of locating an undesirable facility on a network under the anti-cent-dian criterion is addressed. Such criterion represents the convex combination of the undesirable center (maximize the minimum distance) and the undesirable median (maximize the sum of distances). To determine the optimal location point, we propose an efficient algorithm in O(mn) which improves a former approach proposed by other authors in O(mn log n) time. This new algorithm is based on a new upper bound and on some specific properties of the anti-cent-dian problem. (c) 2006 Elsevier Inc. All rights reserved.
Keyword:
undesirable location
anti-cent-dian problem
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
分享收藏The prognostic and diagnostic values of MicroRNA-10b in gastric cancerMicroRNA-10b在胃癌中的预后和诊断价值.png)
Medicine
OAAI
MedicineIF0
OAAI分享收藏Deplacement chimique des protons d'heterocycles etudies par resonance magnetique nucleaireTetrahedron
TetrahedronIF0
PREAI
分享收藏
查看更多内容