We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...