Convex Matroid Optimization
classification
🧮 math.CO
cs.DMmath.OCmath.RA
keywords
convexmatroidassignmentbasescapturescertainclusteringconsider
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.