Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases.

Adil I. Erzin Artem V. Pyatkin

Published in: CSNDSP (2016)

Keyphrases

scheduling problem
special case
np hard
flowshop
computational complexity
worst case
single machine
tree structure
decision problems
total tardiness
space complexity
tree structures
rank aggregation
polynomially solvable
data sets
tree nodes
markov networks
processing times
data structure