A Structural Investigation of the Approximability of Polynomial-Time Problems.

Karl Bringmann Alejandro Cassis Nick Fischer Marvin Künnemann

Published in: ICALP (2022)

Keyphrases

np complete
real time
bayesian networks
decision problems
data sets
real world
information systems
lower bound
special case
optimization problems
application domains
structural information
approximation algorithms
np hardness