Bottleneck subset-type restricted matching problems
type: Item
instance of: scholarly article
title: Bottleneck subset-type restricted matching problems
zbMATH Open document ID: 1466.90085
author: Oleg Duginov
published in: Journal of Combinatorial Optimization
publication date: 2021-05-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7341856
zbMATH Keywords: matching
zbMATH Keywords: edge weighted complete bipartite graph
zbMATH Keywords: computational complexity
zbMATH Keywords: inapproximability
MaRDI profile type: Publication
full work available at URL: s10878-020-00627-8
OpenAlex ID: W3043921832
cites work: Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
cites work: Coloured matchings in bipartite graphs
cites work: Graph Theory
cites work: Finding a Minimum Circuit in a Graph
cites work: Two-Commodity Flow
DOI: 10.1007/S10878-020-00627-8
description: scientific article; zbMATH DE number 7341856