Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Barequet, G., Har-Peled, S.: Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms 38, 91–109 (2001)
2. Bădoiu, M., Har-Peled, S., Indyk, P.: Approximate Clustering via Core-sets. In: Proc. ACM Symp. Theory of Computing (2002)
3. Bertsimas, D., Ye, Y.: Semidefinite relaxations, multivariate normal distributions, and order statistics. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. 1–19. Kluwer Academic Publishers, Dordrecht (1998)
4. Bodlaender, H.L., Gritzmann, P., Klee, V., Van Leeuwen, J.: The Computational Complexity of Norm Maximization. Combinatorica 10, 203–225 (1990)
5. Brieden, A., Gritzmann, P., Klee, V.: Inapproximability of Some Geometric and Quadratic Optimization Problems. In: Pardalos, P.M. (ed.) Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, pp. 96–115. Kluwer, Dordrecht (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献