|
|||||
|
|
A fast algorithm for a class of bottleneck problems |
|
| Authors: | A P Punnen |
| Affiliation: | 1. Department of Mathematics, Statistics and Computer Science, University of New Brunswick, E21 4L5, Saint John, New Brunswick, Canada |
| Abstract: | We show that if a bottleneck problem of sizem with an ordered list of element costs can be solved in O(ξ(m)) time, then the problem with an unordered list of element costs can be solved in O(ξ(m)) log* m) time. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |