Degree sequence optimization in bounded treewidth

Shmuel Onn

doi:https://doi.org/10.1007/s11590-023-01995-w

Degree sequence optimization in bounded treewidth

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 which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it can be solved for arbitrary functions in polynomial time over graphs of bounded treewidth. Its complexity remains widely open, in particular over complete graphs and complete bipartite graphs.

Original language	English
Pages (from-to)	1127-1132
Number of pages	6
Journal	Optimization Letters
Volume	17
Issue number	5
DOIs	https://doi.org/10.1007/s11590-023-01995-w
State	Published - Jun 2023

Keywords

Combinatorial optimization
Degree sequence
Factor
Graph
Matching

All Science Journal Classification (ASJC) codes

Business, Management and Accounting (miscellaneous)
Control and Optimization

Access to Document

https://doi.org/10.1007/s11590-023-01995-w

Cite this

@article{cc2efb53b4334936abc680dad00eccda,

title = "Degree sequence optimization in bounded treewidth",

abstract = "We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it can be solved for arbitrary functions in polynomial time over graphs of bounded treewidth. Its complexity remains widely open, in particular over complete graphs and complete bipartite graphs.",

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

author = "Shmuel Onn",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.",

year = "2023",

month = jun,

doi = "https://doi.org/10.1007/s11590-023-01995-w",

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

volume = "17",

pages = "1127--1132",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

number = "5",

}

TY - JOUR

T1 - Degree sequence optimization in bounded treewidth

AU - Onn, Shmuel

PY - 2023/6

Y1 - 2023/6

N2 - We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it can be solved for arbitrary functions in polynomial time over graphs of bounded treewidth. Its complexity remains widely open, in particular over complete graphs and complete bipartite graphs.

AB - We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it can be solved for arbitrary functions in polynomial time over graphs of bounded treewidth. Its complexity remains widely open, in particular over complete graphs and complete bipartite graphs.

KW - Combinatorial optimization

KW - Degree sequence

KW - Factor

KW - Graph

KW - Matching

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

U2 - https://doi.org/10.1007/s11590-023-01995-w

DO - https://doi.org/10.1007/s11590-023-01995-w

M3 - مقالة

SN - 1862-4472

VL - 17

SP - 1127

EP - 1132

JO - Optimization Letters

JF - Optimization Letters

IS - 5

ER -

Degree sequence optimization in bounded treewidth

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this