Login / Signup
A Structural Investigation of the Approximability of Polynomial-Time Problems.
Karl Bringmann
Alejandro Cassis
Nick Fischer
Marvin Künnemann
Published in:
CoRR (2022)
Keyphrases
</>
solving problems
approximation algorithms
problems involving
computer vision
special case
optimization problems
database
real world
image sequences
computational complexity
artificial neural networks
worst case
simulated annealing
application domains
structural features