super-polynomial approximation algorithms for np-hard problems.

  • Hadas Taubman

Student thesis: MA Thesis

Date of Award13 Nov 2000
Original languageHebrew
Awarding Institution
  • Department of Mathematics
SupervisorGal Chechik (Supervisor) & David Peleg (Supervisor)

Cite this

'