Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths.

Anna Galluccio Guido Proietti

Published in: ISAAC (2001)

Keyphrases

orders of magnitude
computational complexity
computational cost
worst case
optimization problems
times faster
learning algorithm
reinforcement learning
computationally efficient
theoretical analysis
benchmark datasets
recently developed
data structure
shortest path
graph theory