2957 search results - page 43 / 592 » The Complexity of Polynomial-Time Approximation |
142
click to vote
ALT
1995
Springer
15 years 6 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
130
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
133
click to vote
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
178
click to vote
PODS
2011
ACM
14 years 6 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
135
click to vote
DAM
1999
15 years 2 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...