Login / Signup
Generating faster algorithms for d-Path Vertex Cover.
Radovan Cervený
Ondrej Suchý
Published in:
CoRR (2021)
Keyphrases
</>
vertex cover
approximation algorithms
learning algorithm
optimization problems
worst case
theoretical analysis
shortest path
optimality criterion
reinforcement learning
computational complexity
special case
parameter estimation
branch and bound algorithm