scientific article; zbMATH DE number 7376034
From MaRDI portal
Publication:5002791
DOI10.4230/LIPIcs.ICALP.2018.107zbMath1499.68361MaRDI QIDQ5002791
Joachim Spoerhase, Steven Chaplick, Minati De, O. V. Ravskyj
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
local searchapproximation schemebalanced separatorsmaximum coveragegeometric approximation algorithms
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Improved results on geometric hitting set problems
- Approximating low-dimensional coverage problems
- Guarding terrains via local search
- A threshold of ln n for approximating set cover
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
This page was built for publication: