7006 search results - page 3 / 1402 » Approximation Algorithms |
STOC
2001
ACM
14 years 6 months ago
2001
ACM
ESA
2005
Springer
14 years 3 days ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
FCT
2005
Springer
14 years 3 days ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
ECCC
2007
13 years 6 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...