Improved Bounds for Wireless Localization
From MaRDI portal
Recommendations
Cites work
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- An efficient algorithm for finding the CSG representation of a simple polygon
- Computational complexity of art gallery problems
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- Guard placement for efficient point-in-polygon proofs
- Guarding curvilinear art galleries with vertex or point guards
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- Maximizing the guarded boundary of an Art Gallery is APX-complete
- Proofs from THE BOOK
- Traditional Galleries Require Fewer Watchmen
Cited in
(6)- Modem illumination of monotone polygons
- Coverage with k-transmitters in the presence of obstacles
- Optimal art gallery localization is NP-hard
- Solving the natural wireless localization problem to optimality efficiently
- A hybrid metaheuristic strategy for covering with wireless devices
- Improved bounds for wireless localization
This page was built for publication: Improved Bounds for Wireless Localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512449)
