Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond

Finding a maximum cardinality common independent set in two matroids (also known as Matroid Intersection) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum bipartite matching, a maximum colorful forest, and an arborescence in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 304; S. 105282
Hauptverfasser:	Kobayashi, Yasuaki, Kurita, Kazuhiro, Wasa, Kunihiro
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.05.2025
Schlagworte:	Matroid intersection Matroid matching Polynomial-delay enumeration Ranked enumeration Reverse search Matroid intersection Ranked enumeration Polynomial-delay enumeration Matroid matching Reverse search
ISSN:	0890-5401
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!