English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Complexity of Approximating the Vertex Centroid of a Polyhedron

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Elbassioni, Khaled1, Author           
Tiwary, Hans Raj1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1016/j.tcs.2011.11.017
BibTex Citekey: Elbassioni2012b
Other: Local-ID: D6D0668F1BE15B85C1257984005DEC11-Elbassioni2012b
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 421 Sequence Number: - Start / End Page: 56 - 61 Identifier: -