A Polynomial-time Algorithm for the Bottleneck Assignment Problem

Home > Archive>Volume 19, Issue 1, 1997 >94-98

A Polynomial-time Algorithm for the Bottleneck Assignment Problem
DOI:
                        
CSTR:
                        
Author:
                        
Affiliation:
Clc Number:
Fund Project:

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

Abstract:

In this paper, we give a new algorithm for the bottleneck assignment problem on the basis of Konig's theorem, and show that the time complexity of the algorithm is O(n³).

Reference

Cited by

Get Citation

Xiao Bin, Zhang Ganzong. A Polynomial-time Algorithm for the Bottleneck Assignment Problem[J]. Journal of National University of Defense Technology,1997,19(1):94-98.

Copy

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:November 14,1995
Revised:
Adopted:
Online: May 28,2014
Published:

Home

About Journal

Guide for Authors

Editorial Board

Publication Statement

Open Access Statement

Contact

Journal Subscription

Rss

AI assistant

Chinese

Get Citation

Share

Article Metrics

History

Article QR Code