A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.

Spyros Angelopoulos

Published in: ESA (2008)

Keyphrases

upper bound
lower bound
worst case
online learning
graph matching
generalization error bounds
prize collecting
real time
graph structure
weighted graph
minimum spanning tree
bounded treewidth
bayesian networks
np hard
online environment
steiner tree