Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.

Béla Csaba Marek Karpinski Piotr Krysta

Published in: SODA (2002)

Keyphrases

sparse data
optimization problems
high dimensional
combinatorial optimization
standard test problems
genetic algorithm
feature space
particle swarm optimization
traveling salesman problem
randomly generated
partial solutions