Khaled M. Elbassioni, Hans Raj Tiwary. Complexity of Approximating the Vertex Centroid of a Polyhedron. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 413-422, Springer, 2009. [doi]
@inproceedings{ElbassioniT09, title = {Complexity of Approximating the Vertex Centroid of a Polyhedron}, author = {Khaled M. Elbassioni and Hans Raj Tiwary}, year = {2009}, url = {http://springerlink.metapress.com/content/d0241971r0512517/}, researchr = {https://researchr.org/publication/ElbassioniT09}, cites = {0}, citedby = {0}, pages = {413-422}, booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra}, volume = {5878}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-10630-9}, }