5595 search results - page 681 / 1119 » Approximation Algorithms for Clustering Problems |
221
click to vote
MOC
2000
15 years 7 months ago
2000
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
180
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
262
click to vote
DCOSS
2008
Springer
15 years 9 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
225
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
We study the mechanism design problem of scheduling unrelated machines and we completely characterize the decisive truthful mechanisms for two players when the domain contains bot...
172
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...