On bottleneck assignment problems under categorization

Authors:
Abraham P. Punnen
Affiliations:
Department of Mathematical Sciences, University of New Brunswick, Saint John, New Brunswick, Canada E2L 4L5
Venue:
Computers and Operations Research
Year:
2004

Citing 4
Cited 1

Bottleneck assignment problems under categorization

Computers and Operations Research
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

The complexity of bottleneck labeled graph problems

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this note we consider two types of bottleneck assignment problems under categorization and show that the problems are strongly NP-hard. Further, it is observed that the algorithms developed in Agarwal and Tikekar (Comput. Oper. Res. 13 (1986) 11) for these problems are of pseudo-polynomial complexity. Thus contrary to what is reported in Agarwal and Tikekar (1986), these algorithms do not guarantee exact optimality of the solutions produced, unless P=NP.