scientific article; zbMATH DE number 7378614
From MaRDI portal
Publication:5009492
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.2zbMath1476.68270MaRDI QIDQ5009492
Neeraj Kumar, Sayan Bandyapadhyay, Subhash Suri, Kasturi R. Varadarajan
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximationbarrier resilienceminimum color pathminimum constraint removalobstacle removalobstacle-free path
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
The maximum exposure problem ⋮ Shortest paths in the plane with obstacle violations ⋮ The Maximum Exposure Problem.
Cites Work
- Unnamed Item
- Exact algorithms and APX-hardness results for geometric packing and covering problems
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
- Applications of random sampling in computational geometry. II
- The parameterized complexity of some minimum label problems
- Approximation algorithms and hardness results for labeled connectivity problems
- Computing Shortest Paths in the Plane with Removable Obstacles
- Analytical approach to parallel repetition
