Computational Complexity of Approximation Algorithms for Combinatorial Problems.

George Gens, Eugene Levner

Browse the full MFCS paper archive.