Vertex fault-tolerant spanners for weighted points in polygonal domains

DOI10.1142/s1793830922500744zbMath1524.68409OpenAlexW3133686507MaRDI QIDQ6174157

Rajasekhar Inkulu, Apurv Singh

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500744

zbMATH Keywords

geometric spannerscomputational geometryapproximation algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New constructions of SSPDs and their applications
• On bounded degree plane strong geometric spanners
• Kinetic spanners in \(\mathbb R^{d}\)
• Geometric spanners for weighted point sets
• Stable roommates spanner
• Constructing plane spanners of bounded degree and low weight
• Minimum power assignment in wireless ad hoc networks with spanner property
• Sparse geometric graphs with small dilation
• Geometric spanners with small chromatic number
• Region-fault tolerant geometric spanners
• On sparse spanners of weighted graphs
• On plane constrained bounded-degree spanners
• Fault-tolerant geometric spanners
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• There are planar graphs almost as good as the complete graph
• Computing the greedy spanner in near-quadratic time
• Geodesic fault-tolerant additive weighted spanners
• Fault-tolerant additive weighted geometric spanners
• Efficient construction of a bounded-degree spanner with low weight
• An optimal algorithm for computing angle-constrained spanners
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• Geometric Spanner Networks
• Spanners of Additively Weighted Point Sets
• Bypassing the embedding
• DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
• Graph spanners
• Planar Separators
• A Fast Algorithm for Constructing Sparse Euclidean Spanners
• Geodesic Spanners for Points on a Polyhedral Terrain
• Planar spanners and approximate shortest path queries among obstacles in the plane
• From hierarchical partitions to hierarchical covers
• Geometric Spanners for Points Inside a Polygonal Domain
• A simple and efficient kinetic spanner
• Improved algorithms for constructing fault-tolerant spanners

This page was built for publication: Vertex fault-tolerant spanners for weighted points in polygonal domains