Report - OntheApproximability ofNP-complete OptimizationProblemsviggo/papers/phdthesis.pdf · 2007-09-01 · say that P ⊆ NP where P is the set of problems which can be solved by polynomialtimealgorithmsandNP

Please pass captcha verification before submit form