Efficient Algorithms for the Smallest Enclosing Ball Problem

Author： Zhou Guanglu   Tohemail Kim-Chuan   Sun Jie  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.30, Iss.2, 2005-02, pp. : 147-160

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

Rank-two update algorithms for the minimum volume enclosing ellipsoid problem

By Cong Wei-jie   Liu Hong-wei   Ye Feng   Zhou Shui-sheng  

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 241-257

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Parallel Algorithms for the Minimum Cost Flow Problem

By Beraldi P.   Guerriero F.   Musmanno R.  

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 501-530

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for the maximum concurrent flow problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 56-67

John Wiley & Sons Inc

Access to resources Recommend Favorite

Algebraic Methods for Computing Smallest Enclosing and Circumscribing Cylinders of Simplices

By Brandenberg René   Theobald Thorsten  

Applicable Algebra in Engineering, Communication and Computing, Vol. 14, Iss. 6, 2004-03 ,pp. : 439-460

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for the matrix cosine and sine

By Hargreaves Gareth   Higham Nicholas  

Numerical Algorithms, Vol. 40, Iss. 4, 2005-12 ,pp. : 383-400

Springer Publishing Company

Access to resources Recommend Favorite