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. (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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Elbassioni, Khaled1, Author           
Tiwary, Hans Raj2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20092009
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Elbassioni2009ISAAC
DOI: 10.1007/978-3-642-10631-6_43
 Degree: -

Event

show
hide
Title: 20th International Symposium on Algorithms and Computation
Place of Event: Honolulu, Hawaii, USA
Start-/End Date: 2009-12-16 - 2009-12-18

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms and Computation
  Abbreviation : ISAAC 2009
  Subtitle : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 413 - 422 Identifier: ISBN: 978-3-642-10630-9

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 5878 Sequence Number: - Start / End Page: - Identifier: -