Balancing minimum spanning trees and shortest-path trees
type: Item
instance of: scholarly article
title: Balancing minimum spanning trees and shortest-path trees
zbMATH Open document ID: 0833.68096
DOI: 10.1007/BF01294129
author: Samir Khuller
author: Balaji Raghavachari
author: Neal E. Young
published in: Algorithmica
publication date: 1996-03-11T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 803317
zbMATH Keywords: spanning tree
zbMATH Keywords: shortest-path
MaRDI profile type: Publication
cites work: On sparse spanners of weighted graphs
cites work: Routing to Multiple Destinations in Computer Networks
cites work: NEW SPARSENESS RESULTS ON GRAPH SPANNERS
cites work: There are planar graphs almost as good as the complete graph
cites work: Q3651735
cites work: A note on two problems in connexion with graphs
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
cites work: An Optimal Synchronizer for the Hypercube
cites work: Q3694703
cites work: A sparse graph almost as good as the complete graph on points in \(k\) dimensions
full work available at URL: https://doi.org/10.1007/bf01294129
OpenAlex ID: W2951475756
description: scientific article; zbMATH DE number 803317