On approximating NP-hard optimization problems
From MaRDI portal
Publication:1126838
zbMATH Open0910.68093MaRDI QIDQ1126838
Publication date: 5 August 1998
Published in: Documenta Mathematica (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/DMJDMV/xvol-icm/14/Hastad.MAN.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
Improving the complexities of approximation algorithms for optimization problems ⋮ MNP: A class of NP optimization problems ⋮ Reoptimization of NP-Hard Problems ⋮ Approximation algorithms for NP-hard problems ⋮ [[Publication:4864960|Title not available (Why is that?)]]
This page was built for publication: On approximating NP-hard optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126838)
