𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cache Oblivious Algorithms for the RMQ and the RMSQ Problems

✍ Scribed by Masud Hasan; Tanaeem M. Moosa; M. Sohel Rahman


Book ID
107508913
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
202 KB
Volume
3
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Approximation algorithms for the watchma
✍ Xuehou Tan πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 261 KB

Given a simple polygon P with n vertices and a starting point s on its boundary, the watchman route problem asks for a shortest route in P through s such that each point in the interior of the polygon can be seen from at least one point along the route. In this paper, we present a simple, linear-tim