1729 search results - page 295 / 346 » On Bounds for the k-Partitioning of Graphs |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
105
click to vote
DISOPT
2010
14 years 10 months ago
2010
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 studies abou...
DISOPT
2008
14 years 10 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
CAGD
2007
14 years 10 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
IJMC
2006
14 years 10 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...