3874 search results - page 144 / 775 » Approximation Algorithms for k-hurdle Problems |
151
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
ARITH
2007
IEEE
15 years 8 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....
101
click to vote
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper, we propose a reinforcement learning approach to address multi-robot cooperative navigation tasks in infinite settings. We propose an algorithm to simultaneously...
112
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
125
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...