نتایج جستجو برای: best polynomial approximation

تعداد نتایج: 642405  

2012
Konstantin Makarychev Yury Makarychev

In this paper, we present a randomized polynomial-time approximation algorithm for MAX k-CSPd. In MAX k-CSPd, we are given a set of predicates of arity k over an alphabet of size d. Our goal is to find an assignment that maximizes the number of satisfied constraints. Our algorithm has approximation factor Ω(kd/d) (when k ≥ Ω(log d)). This bound is asymptotically optimal assuming the Unique Game...

Journal: :J. Comb. Optim. 2017
Zhi-Zhong Chen Youta Harada Fei Guo Lusheng Wang

Given a graph G, the maximum internal spanning tree problem (MIST for short) asks for computing a spanning tree T of G such that the number of internal vertices in T is maximized. MIST has possible applications in the design of cost-efficient communication networks and water supply networks and hence has been extensively studied in the literature. MIST is NP-hard and hence a number of polynomia...

Journal: :Journal of Approximation Theory 1980

Journal: :Journal of Mathematical Analysis and Applications 1990

Journal: :Journal of Approximation Theory 1987

Journal: :Journal of Mathematics and Computer Science 2015

Journal: :Transactions of the American Mathematical Society 1985

Journal: :SIAM J. Numerical Analysis 2012
Shuhuang Xiang Folkmar Bornemann

We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw–Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n−s−1) for some s > 0, Clenshaw–Curtis and Gauss quadrature inherit exactly this rate. The proof (for Gauss, if 0 < s < 2, there is numerical evidence only) is based on work of Curtis, Johns...

Journal: :Proceedings of the American Mathematical Society 1992

Journal: :Journal of Approximation Theory 1983

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید