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.
Zusammenfassung
Wenn ein Engpaß-Problem der Größem mit sortierten Kostenkoeffizienten in O(ξ(m)) Zeit gelöst werden kann, dann kann das entsprechende allgemeine Problem in O(ξ(m) log* m) Zeit gelöst werden.
This is a preview of subscription content, log in via an institution to check access.
References
Aho, A., Hopcroft, J. E., Ullman, J. D.: The design and analysis of computer algorithms. Reading: Addison-Wesley 1974.
Armstrong, R. D., Jin, Z.: Solving linear bottleneck assignment problem via strong spanning trees. Oper. Res. Lett.12, 179–180 (1992).
Camereni, P. M.: The minimax spanning tree problem and some extensions, Inf. Proc. Lett.7, 10–14 (1978).
Derigs, U., Zimmerman, U.: An augmenting path method for solving linear bottleneck assignment problems. Computing19, 285–298 (1978).
Edmonds, J., Fulkerson, D. R.: Bottleneck extrema. J. Comb. Theory8, 299–306 (1970).
Gabow, H. N., Tarjan, R. E.: Algorithms for two bottleneck optimization problems. Algorithms9, 411–417 (1988).
Garfinkel, R. S., Gilbert, K. C.: The bottleneck traveling salesman problem: algorithms and probabilistic analysis. J. ACM25, 435–448 (1978).
Punnen, A. P., Nair, K. P. K.: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem. Inf. Proc. Lett.50, 283–286 (1994).
Author information
Authors and Affiliations
Additional information
This research was supported by the NSERC grant OGP 0170381.
Rights and permissions
About this article
Cite this article
Punnen, A.P. A fast algorithm for a class of bottleneck problems. Computing 56, 397–401 (1996). https://doi.org/10.1007/BF02253463
Issue Date:
DOI: https://doi.org/10.1007/BF02253463