Technical Note - Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit.

Roy Jonker Rob Kaas Ton Volgenant

Published in: Oper. Res. (1980)

Keyphrases

data dependent
minimum weight
greedy heuristic
generalization bounds
rademacher complexity
risk bounds

bipartite graph
lower bound
randomized algorithm
spanning tree
greedy algorithm
weighted graph

np hard
upper bound
knapsack problem
empirical risk minimization
minimum spanning tree
energy functional

tree patterns
social network analysis
dimensionality reduction
worst case
denoising
optimal solution