Constrained matroidal bottleneck problems

DOI10.1016/0166-218X(95)00114-4zbMath0846.05015MaRDI QIDQ1917230

Igor Averbakh, Abraham P. Punnen, Oded Berman

Publication date: 29 September 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmsuniform matroidsassignment and scheduling problemsconstrained bottleneck independent set problemconstrained bottleneck matroid base problemmatroidal problemsproblems on partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems ⋮ On discrete optimization with ordering ⋮ A class of bottleneck expansion problems ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matroidal knapsack: A class of (often) well-solvable problems
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• The Min-Max Spanning Tree Problem and some extensions
• The Constrained Bottleneck Problem in Networks
• An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem