Reverse shortest path problem for unit-disk graphs
type: Item
instance of: scholarly article
title: Reverse shortest path problem for unit-disk graphs
DOI: 10.1007/978-3-030-83508-8_47
author: N. E. Zubov
publication date: 2022-03-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2104.14476
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498710
MaRDI profile type: Publication
OpenAlex ID: W3197652730
cites work: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
cites work: Sorting in \(c \log n\) parallel steps
cites work: A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
cites work: On an instance of the inverse shortest paths problem
cites work: Shortest paths in intersection graphs of unit disks
cites work: Q4636506
cites work: Q5115792
cites work: Unit disk graphs
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: New lower bounds for Hopcroft's problem
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
cites work: Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
cites work: An Expander-Based Approach to Geometric Optimization
cites work: Q4504025
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: On bounded leg shortest paths problems
cites work: Near-optimal algorithms for shortest paths in weighted unit-disk graphs
cites work: Computation of the reverse shortest-path problem
description: scientific article; zbMATH DE number 7498710