4843 search results - page 315 / 969 » The Shortcut Problem - Complexity and Approximation |
129
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
144
click to vote
SIBGRAPI
2006
IEEE
15 years 10 months ago
2006
IEEE
In this work we address the problem of computing pointbased surface approximations from point clouds. Our approach is based on recently presented methods that define the approxim...
145
click to vote
PPAM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
189
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
144
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...