7930 search results - page 588 / 1586 » Greedy in Approximation Algorithms |
198
click to vote
MOC
1998
15 years 6 months ago
1998
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
180
click to vote
ICPR
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper presents a new background light intensity normalization algorithm suitable for historical document images. The algorithm uses an adaptive linear function to approximate...
187
click to vote
SWAT
2004
Springer
16 years 15 days ago
2004
Springer
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
178
click to vote
FOCS
2003
IEEE
16 years 14 days ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
178
click to vote
CCCG
2008
15 years 8 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...