Deterministic Polylog Approximation for Minimum Communication Spanning Trees.
David PelegEilon ReshefPublished in: ICALP (1998)
Keyphrases
- spanning tree
- edge disjoint
- relative error
- minimum cost
- minimum spanning tree
- approximation algorithms
- minimum spanning trees
- total length
- np hard
- depth first search
- communication systems
- minimum total cost
- original data
- approximation error
- approximation guarantees
- undirected graph
- communication networks
- root node
- communication cost
- edge weights
- lowest cost
- upper bound