Skip to the main content

Journal of computing and information technology, Vol. 1 No. 3, 1993.

Original scientific paper

A Binary Search Algorithm for the Bottleneck Problem of Distinct Representatives

D. Magos ; Department of Informatics, Athens University of Economics and Business, Athens, Greece

Full text: english pdf 2.198 Kb

page 199-203

downloads: 184

cite

Abstract

Binary Search is considered to be one of the most effective and easy-to-use searching techniques. In the current work, an algorithm for the Bottleneck problem of Distinct Representatives based on binary search is presented. Application of the algorithm to the general 0-1 Minimax problem is straightforward. Computational experience including instances with up to 160 000 variables is reported.

Keywords

Binary Search; Minimax problem; Distinct Representatives; Bottleneck Matching

Hrčak ID:

150499

URI

https://hrcak.srce.hr/150499

Publication date:

30.9.1993.

Visits: 676 *