On an approximation measure founded on the links between optimization and polynomial approximation theory

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.158, Iss.1, 1996-05, pp. : 117-141

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Polynomial approximation: a structural and operational study

By Escoffier B.

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 5, Iss. 2, 2007-07 ,pp. : 161-164

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial/Rational Approximation of Minkowski Sum Boundary Curves

By Lee I.-K. Kim M.-S. Elber G.

Graphical Models and Image Processing, Vol. 60, Iss. 2, 1998-03 ,pp. : 136-165

Elsevier

Access to resources Recommend Favorite

Topologically Reliable Approximation of Trimmed Polynomial Surface Patches

By Cho W. Maekawa T. Patrikalakis N.M. Peraire J.

Graphical Models and Image Processing, Vol. 61, Iss. 2, 1999-03 ,pp. : 84-109

Academic Press

Access to resources Recommend Favorite

Small sets in best approximation theory

By Revalski J. Zhivkov N.

Journal of Global Optimization, Vol. 50, Iss. 1, 2011-05 ,pp. : 77-91

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-time approximation schemes for scheduling problems with time lags

By Zhang Xiandong Velde Steef

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 553-559

Springer Publishing Company

Access to resources Recommend Favorite