An Omega(n log n) lower bound for computing the sum of even-ranked elements

Marc Mörig Michiel H. M. Smid Jan Tusch

Published in: CoRR (2009)

Keyphrases

lower bound
upper bound
objective function
worst case
np hard
branch and bound algorithm
lower and upper bounds
branch and bound
optimal solution
e learning
decision trees
lagrangian relaxation
linear programming relaxation
constant factor