676 search results - page 73 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
172
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
160
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
160
click to vote
APPROX
2007
Springer
16 years 11 days ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
129
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
169
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...