The paper defines the dual-world redirected-walking shortest path problem, proves it NP-hard, and gives a polynomial-time approximation scheme called DEWN.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On VR Spatial Query for Dual Entangled Worlds
The paper defines the dual-world redirected-walking shortest path problem, proves it NP-hard, and gives a polynomial-time approximation scheme called DEWN.