4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.CG2010
Odds-On Trees
Prosenjit Bose, Luc Devroye, Karim Douieb +3
Let R^d -> A be a query problem over R^d for which there exists a data structure S that can compute P(q) in O(log n) time for any query point q in R^d. Let D be a probability measu…
cs.CG2010★ 4 cited
Improved Approximation for Guarding Simple Galleries from the Perimeter
James King, David Kirkpatrick
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for buil…