Covering with ellipses

DOI10.1007/S00453-003-1047-0MaRDI QIDQ1889588zbMATH OpenOpenAlexFDO

Authors Frank Hoffmann, Christian Knauer, Carola Wenk, Alon Efrat, Klaus Kriegel, Günter Rote

Publication date 2 December 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1047-0

zbMATH Keywords

randomized approximation algorithm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Biochemistry, molecular biology (92C40) Randomized algorithms (68W20) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2119696
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• New exact algorithms for planar maximum covering location by ellipses problems
• Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
• Covering a plane with ellipses

Cited in

(1)

• scientific article; zbMATH DE number 2119696 (Why is no real title available?)

This page was built for publication: Covering with ellipses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889588)