Uniform and monotone line sum optimization

Martin Koutecký; Shmuel Onn

doi:10.1016/j.dam.2021.04.008

Uniform and monotone line sum optimization

Martin Koutecký, Shmuel Onn

Data and Decision Sciences

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	165-170
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	298
DOIs	https://doi.org/10.1016/j.dam.2021.04.008
State	Published - 31 Jul 2021

Keywords

Column sum
Degree sequence
Graph
Majorization
Matrix
Row sum

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2021.04.008

Cite this

@article{329d7493e87e41749ed0ee316f48b05b,

title = "Uniform and monotone line sum optimization",

abstract = "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.",

keywords = "Column sum, Degree sequence, Graph, Majorization, Matrix, Row sum",

author = "Martin Kouteck{\'y} and Shmuel Onn",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = jul,

day = "31",

doi = "10.1016/j.dam.2021.04.008",

language = "الإنجليزيّة",

volume = "298",

pages = "165--170",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Uniform and monotone line sum optimization

AU - Koutecký, Martin

AU - Onn, Shmuel

PY - 2021/7/31

Y1 - 2021/7/31

N2 - 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.

AB - 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.

KW - Column sum

KW - Degree sequence

KW - Graph

KW - Majorization

KW - Matrix

KW - Row sum

UR - http://www.scopus.com/inward/record.url?scp=85104681526&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2021.04.008

DO - 10.1016/j.dam.2021.04.008

M3 - مقالة

SN - 0166-218X

VL - 298

SP - 165

EP - 170

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Uniform and monotone line sum optimization

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this