Matching is as easy as matrix inversion
Combinatorica
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Nonlinear Matroid Optimization and Experimental Design
SIAM Journal on Discrete Mathematics
Discrete Optimization
| Hi-index | 0.00 |
We consider optimizing a nonlinear objective function over a weighted independence system presented by a linear-optimization oracle. We provide an efficient algorithm that determines an $r$-best solution for nonlinear functions of the total weight of an independent set, where $r$ depends only on certain Frobenius numbers of the individual weights and is independent of the size of the ground set. In contrast, we show that finding an optimal (0-best) solution requires exponential time.