4894 search results - page 151 / 979 » The Guarding Problem - Complexity and Approximation |
150
click to vote
ORL
2008
15 years 6 months ago
2008
In this paper we propose a power penalty approach to linear complementarity problems (LCP) in a finite dimensional space. This approach is based on approximating the LCP by a nonl...
147
click to vote
MOC
2002
15 years 6 months ago
2002
In this paper, we propose and study different mixed variational methods in order to approximate with finite elements the unilateral problems arising in contact mechanics. The discr...
224
click to vote
DAM
2011
15 years 1 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
162
click to vote
MOC
2010
15 years 1 months ago
2010
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
169
click to vote
WAOA
2005
Springer
15 years 12 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...