Nonlinear Bipartite Matching
最优化与控制
2008-07-24 v1 计算复杂性
离散数学
组合数学
摘要
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization and maximization, and a randomized algorithm for optimizing arbitrary objectives.
引用
@article{arxiv.math/0605610,
title = {Nonlinear Bipartite Matching},
author = {Yael Berstein and Shmuel Onn},
journal= {arXiv preprint arXiv:math/0605610},
year = {2008}
}