共 50 条
RECTILINEAR M-CENTER PROBLEM
被引:4
|作者:
KO, MT
[1
]
LEE, RCT
[1
]
CHANG, JS
[1
]
机构:
[1] ACAD SINICA,TAIPEI 115,TAIWAN
关键词:
D O I:
10.1002/nav.3800370306
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
In this article we consider the unweighted m‐center problem with rectilinear distance. We preent an O(nm–2 log n) algorithm for the m‐center problem where m ≥ 4. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company
引用
收藏
页码:419 / 427
页数:9
相关论文