Shifted matroid optimization

From MaRDI portal
Publication:1694792

DOI10.1016/J.ORL.2016.05.013zbMATH Open1380.90238arXiv1507.00447OpenAlexW2963988918MaRDI QIDQ1694792FDOQ1694792

Shmuel Onn, Asaf Levin

Publication date: 6 February 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Abstract: We show that finding lexicographically minimal n bases in a matroid can be done in polynomial time in the oracle model. This follows from a more general result that the shifted problem over a matroid can be solved in polynomial time as well.


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





Cites Work


Cited In (5)


Recommendations





This page was built for publication: Shifted matroid optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694792)