Bottleneck subset-type restricted matching problems

DOI10.1007/s10878-020-00627-8zbMath1466.90085OpenAlexW3043921832MaRDI QIDQ2023130

Oleg Duginov

Publication date: 3 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00627-8

zbMATH Keywords

computational complexitymatchinginapproximabilityedge weighted complete bipartite graph

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Cites Work

• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• Coloured matchings in bipartite graphs
• Graph Theory
• Finding a Minimum Circuit in a Graph
• Two-Commodity Flow