4843 search results - page 144 / 969 » The Shortcut Problem - Complexity and Approximation |
104
click to vote
MOC
2002
15 years 2 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...
177
click to vote
DAM
2011
14 years 10 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...
115
click to vote
MOC
2010
14 years 10 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...
122
click to vote
WAOA
2005
Springer
15 years 8 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...
132
click to vote
COCOON
2001
Springer
15 years 7 months ago
2001
Springer
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...