An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
From MaRDI portal
Publication:4706223
DOI10.1137/S0097539702405139zbMath1053.68106OpenAlexW1976378994MaRDI QIDQ4706223
Stephan J. Eidenbenz, Peter Widmayer
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539702405139
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items