631 search results - page 3 / 127 » Additive Approximation for Edge-Deletion Problems |
STOC
2010
ACM
13 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
ICC
2009
IEEE
14 years 15 days ago
2009
IEEE
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
SIAMNUM
2010
13 years 15 days ago
2010
Semidiscrete finite element approximation of the linear stochastic wave equation with additive noise is studied in a semigroup framework. Optimal error estimates for the determinis...