Hierarchical \(b\)-matching

DOI10.1007/978-3-030-67731-2_14zbMath1492.05127arXiv1904.10210OpenAlexW3128842080MaRDI QIDQ831805

Shmuel Zaks, Shay Kutten, Mordechai Shalom, Yuval Emek

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/1904.10210

zbMATH Keywords

matchingmatroids\(b\)-matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Minimum cost \(b\)-matching problems with neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• Primal-dual approximation algorithms for integral flow and multicut in trees
• A polynomial algorithm for b-matchings: An alternative approach
• A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem
• Tractable combinatorial auctions and \(b\)-matching
• TWO THEOREMS IN GRAPH THEORY
• Data Structures for Weighted Matching and Extensions to b -matching and f -factors
• Paths, Trees, and Flowers
• Max flows in O(nm) time, or better

This page was built for publication: Hierarchical \(b\)-matching