Generalized generation gap algorithm with parent centric crossover is compared with Rosenbrock’s optimization algorithm. Both algorithms were already presented at the BBOB 2009 ...
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...