scientific article; zbMATH DE number 7826444

DOI10.57717/cgt.v3i1.52MaRDI QIDQ6124759

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

Publication date: 2 April 2024

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

zbMATH Keywords

Hamiltonian pathWiener indexminimum routing cost spanning treehardness proofminimum routing cost

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance in graphs (05C12) Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)

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
• Approximation algorithms for some optimum communication spanning tree problems
• 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
• Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
• Wiener index of trees: Theory and applications