Login / Signup
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion.
Bart M. P. Jansen
Michal Wlodarczyk
Published in:
STOC (2022)
Keyphrases
</>
constant factor
approximation algorithms
lower bound
upper bound
worst case
np hard
data sets
genetic algorithm
objective function
scheduling problem
metaheuristic
branch and bound
sample complexity