scientific article; zbMATH DE number 1303537

zbMath0930.68103MaRDI QIDQ4250159

Bang Ye Wu, Vineet Bafna, R. Ravi, Kun-Mao Chao, Giuseppe Lancia, Chuan Yi Tang

Publication date: 9 February 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cost spanning tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem ⋮ Inventory rebalancing and vehicle routing in bike sharing systems ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Approximation algorithms for the k-source multicast tree construction problem ⋮ Near optimal multiple alignment within a band in polynomial time ⋮ Approximation algorithms for some optimum communication spanning tree problems ⋮ The non-approximability of bicriteria network design problems ⋮ Approximation algorithms for the shortest total path length spanning tree problem ⋮ Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion ⋮ On approximating planar metrics by tree metrics. ⋮ Low complexity variants of the arrow distributed directory

This page was built for publication: