Geometric spanning trees minimizing the Wiener index

DOI10.1007/978-3-031-38906-1_1arXiv2303.01096OpenAlexW4385317362MaRDI QIDQ6138982

Unnamed Author, Paz Carmi, A. Karim Abu-Affash, Joseph S. B. Mitchell

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.01096

zbMATH Keywords

Wiener indexminimum routing cost spanning treeoptimum communication spanning tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum weight Euclidean \(t\)-spanner is NP-hard
• On bounded degree plane strong geometric spanners
• On the point for which the sum of the distances to \(n\) given points is minimum
• Improved spanning ratio for low degree plane spanners
• Approximation algorithms for minimizing average distortion
• Local properties of geometric graphs
• Mathematical aspects of Wiener index
• Approximating the average stretch factor of geometric graphs
• Optimum Communication Spanning Trees
• Handbook of Approximation Algorithms and Metaheuristics
• Geometric Spanner Networks
• The complexity of the network design problem
• EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• The Greedy Spanner is Existentially Optimal
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• Wiener index of trees: Theory and applications