de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Complexity of Approximating the Vertex Centroid of a Polyhedron

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45623

Tiwary,  Hans Raj
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Elbassioni, K., & Tiwary, H. R. (2009). Complexity of Approximating the Vertex Centroid of a Polyhedron. In Algorithms and Computation (pp. 413-422). Berlin: Springer. doi:10.1007/978-3-642-10631-6_43.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0024-BC08-F
Abstract
There is no abstract available