4894 search results - page 583 / 979 » The Guarding Problem - Complexity and Approximation |
111
click to vote
IPL
2011
14 years 11 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
159
Voted
TCS
2011
14 years 11 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
134
click to vote
TCS
2011
14 years 11 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
123
click to vote
MOC
2010
14 years 11 months ago
2010
Abstract. We introduce a new technique for the error analysis of hybridizable discontinuous Galerkin (HDG) methods. The technique relies on the use of a new projection whose design...
142
click to vote
NHM
2010
14 years 11 months ago
2010
We study the spatially uniform case of the problem of quasistatic evolution in small strain nonassociative elastoplasticity (Cam-Clay model). Through the introdution of a viscous a...