3019 search results - page 30 / 604 » Approximating the Domatic Number |
146
click to vote
SIGCOMM
2006
ACM
15 years 11 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
173
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
149
click to vote
JGT
2010
15 years 3 months ago
2010
Hadwiger’s conjecture states that every graph with chromatic number χ has a clique minor of size χ. In this paper we prove a weakened version of this conjecture for the class ...
131
click to vote
FCT
2003
Springer
15 years 10 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
114
click to vote
ARITH
2007
IEEE
15 years 11 months ago
2007
IEEE
In the present paper, we investigate the approximation of a function by a polynomial with floating-point coefficients; we are looking for the best approximation in the L2 sense....