Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry.
Spyros AngelopoulosPublished in: SODA (2007)
Keyphrases
- weighted graph
- undirected graph
- upper bound
- online learning
- graph matching
- real time
- edge information
- graph theory
- graph clustering
- edge detection
- lower bound
- graph theoretic
- improved algorithm
- graph structure
- bounded degree
- prize collecting
- minimum spanning trees
- vertex set
- bounded treewidth
- online environment
- online algorithms
- upper and lower bounds
- spanning tree