Red-black spanners for mixed-charging vehicular networks

DOI10.1007/978-3-031-49190-0_16MaRDI QIDQ6591473

Binhai Zhu, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Sergey Bereg

Publication date: 22 August 2024

zbMATH Keywords

geometric spannersapproximation algorithmsDelaunay triangulations

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• On plane geometric spanners: a survey and open problems
• Delaunay graphs are almost as good as complete graphs
• Classes of graphs which approximate the complete Euclidean graph
• The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
• The Stretch Factor of L 1- and L  ∞ -Delaunay Triangulations
• Towards plane spanners of degree 3
• Geometric Spanner Networks
• DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
• Lower Bounds on the Dilation of Plane Spanners

This page was built for publication: Red-black spanners for mixed-charging vehicular networks