English

Shifted Matroid Optimization

Optimization and Control 2016-06-28 v2 Discrete Mathematics Data Structures and Algorithms Combinatorics

Abstract

We show that finding lexicographically minimal nn 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.

Keywords

Cite

@article{arxiv.1507.00447,
  title  = {Shifted Matroid Optimization},
  author = {Asaf Levin and Shmuel Onn},
  journal= {arXiv preprint arXiv:1507.00447},
  year   = {2016}
}
R2 v1 2026-06-22T10:04:15.041Z