Year: 2002
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Onn, Shmuel
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Israel Science Foundation
OpenAlex ID: W2950185224