C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On the star decomposition of a graph: Hardness results and approximation for the max-min optimization problem.
Ferdinando Cicalese
Eduardo Sany Laber
Published in:
Discret. Appl. Math. (2021)
Keyphrases
</>
max min
min max
hill climbing
efficient computation
difference equations
robust optimization
case based reasoning
particle swarm optimization
np complete
graph matching
directed acyclic graph
graph theoretic
weighted graph
artificial intelligence
approximation algorithms
scheduling problem
computational complexity