3341 search results - page 237 / 669 » On Bounded Queries and Approximation |
176
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
136
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...
180
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...
214
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
157
click to vote
IPL
2002
15 years 6 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...