3875 search results - page 29 / 775 » Approximation Algorithms for the Max-coloring Problem |
105
click to vote
SIAMDM
2008
15 years 2 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
129
click to vote
RECOMB
2010
Springer
15 years 26 days ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
117
click to vote
JUCS
2007
15 years 2 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
104
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
104
click to vote
STOC
1995
ACM
15 years 6 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...