Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
type: Item
instance of: scholarly article
title: Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
zbMATH Open document ID: 1075.68090
published in: Theoretical Computer Science
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2083136
zbMATH Keywords: Shortest path
zbMATH Keywords: Skew lines problem
author: Dmitri Burago
author: Dima Grigoriev
author: Anatol Slissenko
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.01.014
OpenAlex ID: W2047629658
cites work: Approximating shortest paths on a convex polytope in three dimensions
cites work: Q4848742
cites work: Geometry IV. Non-regular Riemannian geometry. Transl. from the Russian by E. Primrose
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Hard balls gas and Alexandrov spaces of curvature bounded above
cites work: Uniform estimates on the number of collisions in semi-dispersing billiards
cites work: Approximate Euclidean Shortest Paths in 3-Space
cites work: Q4232467
cites work: Constructing Approximate Shortest Path Maps in Three Dimensions
cites work: Search for shortest path around semialgebraic obstacles in the plane
cites work: Q4945516
cites work: The Discrete Geodesic Problem
cites work: The weighted region problem
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: An algorithm for shortest-path motion in three dimensions
cites work: Q4385513
cites work: On Shortest Paths in Polyhedral Spaces
DOI: 10.1016/J.TCS.2004.01.014
description: scientific article; zbMATH DE number 2083136