Average competitive ratios of on-line spanning trees
Information Processing Letters
Saved in:
Main Authors: | Bao, F., Mei, A., Igarashi, Y. |
---|---|
Other Authors: | INSTITUTE OF SYSTEMS SCIENCE |
Format: | Article |
Published: |
2016
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/129710 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Real-time hierarchical supervoxel segmentation via a minimum spanning tree
by: WANG, Bo, et al.
Published: (2020) -
Approximating the Spanning k-Tree Forest Problem
by: Liao, C.-S., et al.
Published: (2014) -
Multidimensional on-line bin-packing: An algorithm and its average-case analysis
by: Chang, E.-C., et al.
Published: (2014) -
Scalable parallel minimum spanning forest computation
by: Nobari, S., et al.
Published: (2013) -
The central limit theorem for weighted minimal spanning trees on random points
by: Kesten, H., et al.
Published: (2014)