A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources

Authors:
Dorit S. Hochbaum;Gerhard J. Woeginger
Affiliations:
Department of IEOR, University of California, Berkeley, CA 94720, USA;Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
1999

Citing 8
Cited 1

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

Information Processing Letters
Fast algorithms for bipartite network flow

SIAM Journal on Computing
Integer and combinatorial optimization

Integer and combinatorial optimization
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Time bounds for selection

Journal of Computer and System Sciences
An optimal algorithm for 2 × n bottleneck transportation problems

Operations Research Letters
An instant solution of the 2 × n bottleneck transportation problem

Operations Research Letters

A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a special case of the bottleneck transportation problem where the number s of sources is bounded by a constant and not part of the input. For the subcase s=2, a best-possible linear-time algorithm has been derived by Varadarajan [Oper. Res. Lett. 10 (1991) 525-529]. In this note we show that for any fixed number s=1, the bottleneck transportation problem with s sources can be solved in linear-time. The algorithm is conceptually simple, and easy to implement.