Comparison of Stochastic and Approximation Algorithms for One-Dimensional Cutting Problems.

Zafer Bingul Cuneyt Oysu

Published in: ICIC (1) (2005)

Keyphrases

approximation algorithms
approximation schemes
vertex cover
np hard
exact algorithms
special case
randomized algorithms
network design problem
np hardness
optimization problems
worst case
minimum cost
facility location problem
objective function
upper bound
disjoint paths