Convex Matroid Optimization
Skip to main content
Open Access Publications from the University of California

Department of Mathematics

Other bannerUC Davis

Convex Matroid Optimization

Published Web Location
No data is associated with this publication.

We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.

Item not freely available? Link broken?
Report a problem accessing this item