3415 search results - page 406 / 683 » Lower bounds on kernelization |
146
click to vote
STACS
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
159
click to vote
WINE
2007
Springer
16 years 22 days ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
207
click to vote
CCECE
2006
IEEE
16 years 21 days ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
158
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
170
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...