Login / Signup
Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting.
Sorrachai Yingchareonthawornchai
Proteek Chandan Roy
Bundit Laekhanukit
Eric Torng
Kalyanmoy Deb
Published in:
GECCO Companion (2020)
Keyphrases
</>
worst case
average case
computational complexity
error bounds
worst case analysis
computationally efficient
upper bound
significant improvement
theoretical analysis
orders of magnitude
lower bound
running times
learning algorithm
np hard
optimization problems
np complete
combinatorial optimization
greedy algorithm