3019 search results - page 40 / 604 » Approximating the Domatic Number |
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in
AAIM
2007
Springer
15 years 6 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
112
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
110
click to vote
AAIM
2010
Springer
15 years 3 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
ADCM
2000
14 years 11 months ago
2000
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...