Convex Matroid Optimization
组合数学
2018-08-21 v1 离散数学
最优化与控制
环与代数
摘要
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.
引用
@article{arxiv.math/0207136,
title = {Convex Matroid Optimization},
author = {Shmuel Onn},
journal= {arXiv preprint arXiv:math/0207136},
year = {2018}
}