2137 search results - page 184 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
199
click to vote
EC
2008
15 years 6 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
158
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
219
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
149
click to vote
MOC
2000
15 years 6 months ago
2000
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
175
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...