Solving the natural wireless localization problem to optimality efficiently

DOI10.1016/J.COMGEO.2014.12.004MaRDI QIDQ2341690zbMATH OpenOpenAlexFDO

Authors Bruno E. Crepaldi, Pedro J. de Rezende, Cid Carvalho de Souza

Publication date 27 April 2015

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2014.12.004

zbMATH Keywords

computational geometryinteger programmingexact algorithmart gallery problemwireless localization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Improved Bounds for Wireless Localization
• Improved bounds for wireless localization
• Optimal art gallery localization is NP-hard
• A hybrid metaheuristic strategy for covering with wireless devices
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• An exact algorithm for minimizing vertex guards on art galleries
• Exact solutions and bounds for general art gallery problems
• Guard placement for efficient point-in-polygon proofs
• Improved Bounds for Wireless Localization

Cited in

(5)

• Improved bounds for wireless localization
• A hybrid metaheuristic strategy for covering with wireless devices
• Optimal Nonlinear Estimation for Localization of Wireless Sensor Networks
• Improved Bounds for Wireless Localization
• Optimal art gallery localization is NP-hard

This page was built for publication: Solving the natural wireless localization problem to optimality efficiently

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