Minimum congestion spanning trees of grids and discrete toruses.
Alberto CastejónMikhail I. OstrovskiiPublished in: Discuss. Math. Graph Theory (2009)
Keyphrases
- spanning tree
- edge disjoint
- minimum cost
- minimum spanning tree
- minimum spanning trees
- euclidean plane
- minimum total cost
- undirected graph
- root node
- data structure
- finite number
- traffic congestion
- irregular isothetic grids
- depth first search
- continuous domains
- congestion control
- total length
- grid computing
- end to end
- optimization problems
- np hard
- high dimensional