Uniform and Monotone Line Sum Optimization
Optimization and Control
2021-04-28 v2 Computational Complexity
Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Abstract
The {\em line sum optimization problem} asks for a -matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {\em uniform} problem, with identical row functions and identical column functions, and the {\em monotone} problem, over matrices with nonincreasing row and column sums, are polynomial time solvable.
Cite
@article{arxiv.2011.09932,
title = {Uniform and Monotone Line Sum Optimization},
author = {Martin Koutecky and Shmuel Onn},
journal= {arXiv preprint arXiv:2011.09932},
year = {2021}
}