Shifted Matroid Optimization

Asaf Levin; Shmuel Onn

arxiv: 1507.00447 · v2 · pith:3EIPB2WZnew · submitted 2015-07-02 · 🧮 math.OC · cs.DM· cs.DS· math.CO

Shifted Matroid Optimization

Asaf Levin , Shmuel Onn This is my paper

classification 🧮 math.OC cs.DMcs.DSmath.CO

keywords matroidpolynomialshiftedtimebasesdonefindingfollows

0 comments

read the original 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.

This paper has not been read by Pith yet.

Shifted Matroid Optimization

discussion (0)