Faster approximation algorithms for weighted triconnectivity augmentation problems.

Zeev Nutov Michal Penn

Published in: Oper. Res. Lett. (1997)

Keyphrases

approximation algorithms
vertex cover
np hardness
approximation schemes
randomized algorithms
exact algorithms
np hard
network design problem
minimum cost
practical problems
np complete
constant factor
optimization problems
error bounds
genetic algorithm
set cover
approximation ratio
planar graphs
upper bound