2000 character limit reached
Uniform and Monotone Line Sum Optimization
Published 19 Nov 2020 in math.OC, cs.CC, cs.DM, cs.DS, and math.CO | (2011.09932v2)
Abstract: The {\em line sum optimization problem} asks for a $(0,1)$-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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
