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. 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
{"_id":"QkigFurvJGZA2hMWi","bibbaseid":"elbassioni-rajtiwary-complexityofapproximatingthevertexcentroidofapolyhedron-2009","downloads":0,"creationDate":"2016-03-20T13:42:19.151Z","title":"Complexity of Approximating the Vertex Centroid of a Polyhedron","author_short":["Elbassioni, K. M.","Raj Tiwary, H."],"year":2009,"bibtype":"inproceedings","biburl":"http://www.dblp.org/rec/bibtex/conf/isaac/ElbassioniT09","bibdata":{"title":"Complexity of Approximating the Vertex Centroid of a Polyhedron","author":["Khaled M. Elbassioni","Hans Raj Tiwary"],"author_short":["Elbassioni, K. M.","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)","bibtex":"@inproceedings{ dblp3259390,\n title = {Complexity of Approximating the Vertex Centroid of a Polyhedron},\n author = {Khaled M. Elbassioni and Hans Raj Tiwary},\n author_short = {Elbassioni, K. M. and Raj Tiwary, H.},\n bibtype = {inproceedings},\n type = {inproceedings},\n year = {2009},\n key = {dblp3259390},\n id = {dblp3259390},\n biburl = {http://www.dblp.org/rec/bibtex/conf/isaac/ElbassioniT09},\n url = {http://dx.doi.org/10.1007/978-3-642-10631-6_43},\n conference = {ISAAC},\n pages = {413-422},\n text = {ISAAC 2009:413-422},\n booktitle = {Proceedings of International Symposium on Algorithms and Computation (ISAAC)}\n}","bibbaseid":"elbassioni-rajtiwary-complexityofapproximatingthevertexcentroidofapolyhedron-2009","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/978-3-642-10631-6_43"},"downloads":0},"search_terms":["complexity","approximating","vertex","centroid","polyhedron","elbassioni","raj tiwary"],"keywords":[],"authorIDs":[],"dataSources":["MHBiQ27j4JGrDBBv3"]}