2569 search results - page 87 / 514 » Approximate Objects and Approximate Theories |
167
click to vote
FSTTCS
2009
Springer
16 years 27 days ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
196
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
156
click to vote
MICAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Often, qualitative values have an ordering, such as (veryshort, short, medium-height, tall) or a hierarchical level, such as (TheWorld, Europe, Spain, Madrid), which are ...
166
click to vote
ICALP
1998
Springer
15 years 10 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
176
click to vote
IGIS
1994
15 years 10 months ago
1994
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...