Computing Shortest Paths in the Plane with Removable Obstacles

From MaRDI portal
Revision as of 14:41, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5116468


DOI10.4230/LIPIcs.SWAT.2018.5zbMath1477.68454MaRDI QIDQ5116468

Stavros Sintos, Neeraj Kumar, Pankaj K. Agarwal, Subhash Suri

Publication date: 25 August 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8831/pdf/LIPIcs-SWAT-2018-5.pdf/


68Q25: Analysis of algorithms and problem complexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68P05: Data structures

68W25: Approximation algorithms


Related Items



Cites Work