
AbstractIn 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.
rectilinear distance, Analysis of algorithms and problem complexity, unweighted m-center problem, Inventory, storage, reservoirs
rectilinear distance, Analysis of algorithms and problem complexity, unweighted m-center problem, Inventory, storage, reservoirs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
