Finding ultrametric minimum-diameter spanning trees

DOI10.1016/J.TCS.2026.115769MaRDI QIDQ6851437zbMATH OpenFDO

Authors Ching-Lueh Chang

Publication date 27 February 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115769

zbMATH Keywords

ultrametric spaceminimum-diameter spanning treesublinear computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A distributed algorithm for constructing a minimum diameter spanning tree
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Metric sublinear algorithms via linear sampling
• Minimum Diameter Spanning Trees and Related Problems
• Non-Archimedean Metrics in Topology
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On the minimum diameter spanning tree problem
• Spanning Trees and Optimization Problems
• Sublinear time algorithms for metric space problems
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities

This page was built for publication: Finding ultrametric minimum-diameter spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851437)