A matroid view of key theorems for edge-swapping algorithms

Jon Lee () and Leo Liberti ()

Mathematical Methods of Operations Research, 2012, vol. 76, issue 2, 125-127

Abstract: We demonstrate that two key theorems of Amaldi et al. (Math Methods Oper Res 69:205–223, 2009 ), which they presented with rather complicated proofs, can be more easily and cleanly established using a simple and classical property of binary matroids. Besides a simpler proof, we see that both of these key results are manifestations of the same essential property. Copyright Springer-Verlag 2012

Keywords: Binary matroid; Edge swapping; Fundamental circuit (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s00186-012-0392-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:76:y:2012:i:2:p:125-127

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-012-0392-7

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().