Complexity of Approximating the Vertex Centroid of a Polyhedron

Elbassioni, Khaled; Tiwary, Hans Raj

doi:10.1016/j.tcs.2011.11.017

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Complexity of Approximating the Vertex Centroid of a Polyhedron

MPS-Authors

/persons/resource/persons44374

Elbassioni, Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45623

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

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Elbassioni, K., & Tiwary, H. R. (2012). Complexity of Approximating the Vertex Centroid of a Polyhedron. Theoretical Computer Science, 421, 56-61. doi:10.1016/j.tcs.2011.11.017.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-BC84-9

Abstract

There is no abstract available