Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

D. Burago; D. Grigoriev; A. Slissenko

doi:10.1016/j.tcs.2004.01.014

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

D. Burago, D. Grigoriev, A. Slissenko

Research output: Contribution to journal › Article

6 Scopus citations

Abstract

The approximation of shortest path for skew line problems in time doubly logarithmic in 1/epsilon was studied. A three-dimensional situation was considered where a polytime algorithm for approximating a shortest path can be constructed. Very simple grid approximations were also analyzed by assuming that a parameter describing separability of obstacle is given. It was found that that there is a algorithm of time complexity, which finds a path whose length is bounded from above.

Original language	English (US)
Pages (from-to)	371-404
Number of pages	34
Journal	Theoretical Computer Science
Volume	315
Issue number	2-3
DOIs	https://doi.org/10.1016/j.tcs.2004.01.014
State	Published - May 6 2004

Fingerprint

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Cite this

Burago, D., Grigoriev, D., & Slissenko, A. (2004). Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Theoretical Computer Science, 315(2-3), 371-404. https://doi.org/10.1016/j.tcs.2004.01.014

@article{ca979a991efa4134acbe79ae1ce3dbef,

title = "Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon",

abstract = "The approximation of shortest path for skew line problems in time doubly logarithmic in 1/epsilon was studied. A three-dimensional situation was considered where a polytime algorithm for approximating a shortest path can be constructed. Very simple grid approximations were also analyzed by assuming that a parameter describing separability of obstacle is given. It was found that that there is a algorithm of time complexity, which finds a path whose length is bounded from above.",

author = "D. Burago and D. Grigoriev and A. Slissenko",

year = "2004",

month = may

day = "6",

doi = "10.1016/j.tcs.2004.01.014",

language = "English (US)",

volume = "315",

pages = "371--404",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "2-3",

}

TY - JOUR

T1 - Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

AU - Burago, D.

AU - Grigoriev, D.

AU - Slissenko, A.

PY - 2004/5/6

Y1 - 2004/5/6

N2 - The approximation of shortest path for skew line problems in time doubly logarithmic in 1/epsilon was studied. A three-dimensional situation was considered where a polytime algorithm for approximating a shortest path can be constructed. Very simple grid approximations were also analyzed by assuming that a parameter describing separability of obstacle is given. It was found that that there is a algorithm of time complexity, which finds a path whose length is bounded from above.

AB - The approximation of shortest path for skew line problems in time doubly logarithmic in 1/epsilon was studied. A three-dimensional situation was considered where a polytime algorithm for approximating a shortest path can be constructed. Very simple grid approximations were also analyzed by assuming that a parameter describing separability of obstacle is given. It was found that that there is a algorithm of time complexity, which finds a path whose length is bounded from above.

UR - http://www.scopus.com/inward/record.url?scp=2042536010&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2042536010&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2004.01.014

DO - 10.1016/j.tcs.2004.01.014

M3 - Article

AN - SCOPUS:2042536010

VL - 315

SP - 371

EP - 404

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2-3

ER -

Access to Document

10.1016/j.tcs.2004.01.014