Weak coverage of a rectangular barrier

From MaRDI portal

DOI10.1007/978-3-319-57586-5_17MaRDI QIDQ6828267zbMATH OpenFDO

Authors Stefan Dobrev, Evangelos Kranakis, D. Krizanc, Manuel Lafond, Ján Maňuch, Lata Narayanan, Jaroslav Opatrny, Sunil Shende, Ladislav Stacho

Publication date 21 July 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57586-5_17


Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40) Discrete location and assignment (90B80)














This page was built for publication: Weak coverage of a rectangular barrier

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Weak_coverage_of_a_rectangular_barrier&oldid=56007886"
Powered by MediaWiki