A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids

zbMath1461.90119arXiv1909.13261MaRDI QIDQ5854169

Yu Yokoi, Satory Fujishige, Kenjiro Takazawa

Publication date: 16 March 2021

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

zbMATH Keywords

combinatorial optimizationmatroidcommon independent setsnearly uniform partition

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs

This page was built for publication: A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids