Complexity of Approximating the Vertex Centroid of a Polyhedron. Elbassioni, K. M. & Raj Tiwary, H. In Proceedings of International Symposium on Algorithms and Computation (ISAAC), pages 413-422, 2009.
Complexity of Approximating the Vertex Centroid of a Polyhedron [link]Paper  bibtex   
@inproceedings{ dblp3259390,
  title = {Complexity of Approximating the Vertex Centroid of a Polyhedron},
  author = {Khaled M. Elbassioni and Hans Raj Tiwary},
  author_short = {Elbassioni, K. M. and Raj Tiwary, H.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2009},
  key = {dblp3259390},
  id = {dblp3259390},
  biburl = {http://www.dblp.org/rec/bibtex/conf/isaac/ElbassioniT09},
  url = {http://dx.doi.org/10.1007/978-3-642-10631-6_43},
  conference = {ISAAC},
  pages = {413-422},
  text = {ISAAC 2009:413-422},
  booktitle = {Proceedings of International Symposium on Algorithms and Computation (ISAAC)}
}

Downloads: 0