A matroid view of key theorems for edge-swapping algorithms

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

MoreLess

Year of publication:	2012
Authors:	Lee, Jon ; Liberti, Leo
Published in:	Computational Statistics. - Springer. - Vol. 76.2012, 2, p. 125-127
Publisher:	Springer
Subject:	Binary matroid \| Edge swapping \| Fundamental circuit

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010847897