Uniform and monotone line sum optimization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437093" target="_blank" >RIV/00216208:11320/21:10437093 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ENjuHFg-Ih" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ENjuHFg-Ih</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2021.04.008" target="_blank" >10.1016/j.dam.2021.04.008</a>

Result language
angličtina
Original language name
Uniform and monotone line sum optimization
Original language description
The 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 uniform problem, with identical row functions and identical column functions, and the monotone problem, over matrices with nonincreasing row and column sums, are polynomial time solvable. (C) 2021 Elsevier B.V. All rights reserved.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)