Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems

DOI10.1016/S0020-0190(98)00170-7zbMATH Open1339.68106OpenAlexW2063379221MaRDI QIDQ293458FDOQ293458

Authors: Peter Jonsson 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00170-7

zbMATH Keywords

computational complexityapproximationcombinatorial problems

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of approximating the independent set problem
• Strong lower bounds on the approximability of some NPO PB-complete maximization problems
• Title not available (Why is that?)

This page was built for publication: Near-optimal nonapproximability results for some \textsc{Npo} PB-complete problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293458)