A fast algorithm for a class of bottleneck problems

DOI10.1007/BF02253463zbMath0849.90098OpenAlexW1559997236MaRDI QIDQ1916054

Abraham P. Punnen

Publication date: 2 July 1996

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253463

zbMATH Keywords

polynomial algorithmsbottleneck problemordered list of element costs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Quadratic bottleneck problems ⋮ Bottleneck flows in unit capacity networks ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ Deterministic Graphical Games Revisited

Cites Work

• Unnamed Item
• Solving linear bottleneck assignment problems via strong spanning trees
• An augmenting path method for solving linear bottleneck assignment problems
• The Min-Max Spanning Tree Problem and some extensions
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• Algorithms for two bottleneck optimization problems
• The Bottleneck Traveling Salesman Problem
• Bottleneck extrema