A fast algorithm for a class of bottleneck problems
type: Item
instance of: scholarly article
title: A fast algorithm for a class of bottleneck problems
zbMATH Open document ID: 0849.90098
DOI: 10.1007/BF02253463
author: Abraham P. Punnen
published in: Computing
publication date: 1996-07-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 895862
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: bottleneck problem
zbMATH Keywords: ordered list of element costs
MaRDI profile type: Publication
cites work: Q4091421
cites work: Solving linear bottleneck assignment problems via strong spanning trees
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: An augmenting path method for solving linear bottleneck assignment problems
cites work: Bottleneck extrema
cites work: Algorithms for two bottleneck optimization problems
cites work: The Bottleneck Traveling Salesman Problem
cites work: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
full work available at URL: https://doi.org/10.1007/bf02253463
OpenAlex ID: W1559997236
description: scientific article; zbMATH DE number 895862