On degree sequence optimization

Shmuel Onn

doi:10.1016/j.orl.2020.10.010

On degree sequence optimization

Shmuel Onn

Data and Decision Sciences

Technion - Israel Institute of Technology

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

Abstract

We consider the problem of finding a subgraph of a given graph maximizing a given function evaluated at its degree sequence. While it is intractable already for convex functions, we show it is polynomial time solvable for convex multi-criteria objectives. We also consider a colored extension of the problem with separable objectives, which includes the notorious exact matching problem as a special case, and show that it is polynomial time solvable on graphs of bounded tree-depth for any vertex functions.

Original language	English
Pages (from-to)	840-843
Number of pages	4
Journal	Operations Research Letters
Volume	48
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2020.10.010
State	Published - Nov 2020

Keywords

Combinatorial optimization
Degree sequence
Factor
Graph
Integer programming
Matching

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2020.10.010

Cite this

@article{dfc6b36485bf40cd8bdc5d79532b50d5,

title = "On degree sequence optimization",

abstract = "We consider the problem of finding a subgraph of a given graph maximizing a given function evaluated at its degree sequence. While it is intractable already for convex functions, we show it is polynomial time solvable for convex multi-criteria objectives. We also consider a colored extension of the problem with separable objectives, which includes the notorious exact matching problem as a special case, and show that it is polynomial time solvable on graphs of bounded tree-depth for any vertex functions.",

keywords = "Combinatorial optimization, Degree sequence, Factor, Graph, Integer programming, Matching",

author = "Shmuel Onn",

note = "Funding Information: S. Onn was supported by a grant from the Israel Science Foundation and the Dresner chair. Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = nov,

doi = "10.1016/j.orl.2020.10.010",

language = "English",

volume = "48",

pages = "840--843",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - On degree sequence optimization

AU - Onn, Shmuel

PY - 2020/11

Y1 - 2020/11

N2 - We consider the problem of finding a subgraph of a given graph maximizing a given function evaluated at its degree sequence. While it is intractable already for convex functions, we show it is polynomial time solvable for convex multi-criteria objectives. We also consider a colored extension of the problem with separable objectives, which includes the notorious exact matching problem as a special case, and show that it is polynomial time solvable on graphs of bounded tree-depth for any vertex functions.

AB - We consider the problem of finding a subgraph of a given graph maximizing a given function evaluated at its degree sequence. While it is intractable already for convex functions, we show it is polynomial time solvable for convex multi-criteria objectives. We also consider a colored extension of the problem with separable objectives, which includes the notorious exact matching problem as a special case, and show that it is polynomial time solvable on graphs of bounded tree-depth for any vertex functions.

KW - Combinatorial optimization

KW - Degree sequence

KW - Factor

KW - Graph

KW - Integer programming

KW - Matching

UR - https://www.scopus.com/pages/publications/85095786306

U2 - 10.1016/j.orl.2020.10.010

DO - 10.1016/j.orl.2020.10.010

M3 - Article

SN - 0167-6377

VL - 48

SP - 840

EP - 843

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

On degree sequence optimization

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this