Optimization over degree sequences is polynomial-time solvable when all vertex cost functions are convex on any graph, and in several unbalanced or monotone structured cases, while remaining NP-hard in general.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimization over Degree Sequences of Graphs
Optimization over degree sequences is polynomial-time solvable when all vertex cost functions are convex on any graph, and in several unbalanced or monotone structured cases, while remaining NP-hard in general.