3875 search results - page 65 / 775 » Approximation Algorithms for the Max-coloring Problem |
ASIAN
1999
Springer
14 years 1 months ago
1999
Springer
WAOA
2004
Springer
14 years 2 months ago
2004
Springer
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
SODA
2001
ACM
13 years 10 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
SIAMJO
2008
13 years 8 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...