2 papers
cs.CG2012
Approximation Schemes for Covering and Packing
Rom Aschner, Matthew J. Katz, Gila Morgenstern +1
The local search framework for obtaining PTASs for NP-hard geometric optimization problems was introduced, independently, by Chan and Har-Peled (2009) and Mustafa and Ray (2010). I…
cs.DC2012
Efficient Private Distributed Computation on Unbounded Input Streams
Shlomi Dolev, Juan Garay, Niv Gilboa +2
In the problem of swarm computing, agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of s…