1469 search results - page 105 / 294 » Approximate polynomial decomposition |
112
click to vote
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
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...
116
click to vote
SIAMNUM
2010
14 years 4 months ago
2010
The purpose of this study is to construct a high-order interpolation scheme for arbitrary scattered datasets. The resulting function approximation is an interpolation function when...
ENTCS
2002
14 years 9 months ago
2002
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...