{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:07:00Z","timestamp":1765609620830,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,8]]},"DOI":"10.1145\/2582112.2582133","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:01:31Z","timestamp":1399039291000},"page":"318-327","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Random-Walk Methods for Approximating Polytope Volume"],"prefix":"10.1145","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[{"name":"Department of Informatics and Telecommunications, University of Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vissarion","family":"Fisikopoulos","sequence":"additional","affiliation":[{"name":"Department of Informatics and Telecommunications, University of Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"MSRI","author":"Agarwal P.K.","year":"2005","unstructured":"P.K. Agarwal , S. Har-Peled , and K.R. Varadarajan . Geometric approximation via coresets. In Combinatorial and Computational Geometry , MSRI , pages 1 -- 30 . University Press , 2005 . P.K. Agarwal, S. Har-Peled, and K.R. Varadarajan. Geometric approximation via coresets. In Combinatorial and Computational Geometry, MSRI, pages 1--30. University Press, 2005."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261305"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.110"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2850-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008733"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573960"},{"volume-title":"VINCI","author":"B\u00fceler B.","key":"e_1_3_2_1_8_1","unstructured":"B. B\u00fceler and A. Enge . VINCI . http:\/\/www.math.u-bordeaux1.fr\/~aenge\/index.php?category=software&page=vinci. B. B\u00fceler and A. Enge. VINCI. http:\/\/www.math.u-bordeaux1.fr\/~aenge\/index.php?category=software&page=vinci."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"B.\n      B\u00fceler A.\n      Enge and \n      K.\n      Fukuda\n  . \n  Exact\n   volume computation for polytopes: A practical study. In Polytopes: Combinatorics and Computation volume \n  29\n   of \n  Oberwolfach Seminars pages \n  131\n  --\n  154\n  . \n  Birkh\u00e4user 2000\n  .  B. B\u00fceler A. Enge and K. Fukuda. Exact volume computation for polytopes: A practical study. In Polytopes: Combinatorics and Computation volume 29 of Oberwolfach Seminars pages 131--154. Birkh\u00e4user 2000.","DOI":"10.1007\/978-3-0348-8438-9_6"},{"issue":"0","key":"e_1_3_2_1_10_1","article-title":"The asymptotic volume of the birkhoff polytope","volume":"4","author":"Canfield E.","year":"2009","unstructured":"E. Canfield and B. McKay . The asymptotic volume of the birkhoff polytope . Online Journal of Analytic Combinatorics , 4 ( 0 ), 2009 . E. Canfield and B. McKay. The asymptotic volume of the birkhoff polytope. Online Journal of Analytic Combinatorics, 4(0), 2009.","journal-title":"Online Journal of Analytic Combinatorics"},{"key":"e_1_3_2_1_11_1","unstructured":"CGAL\n  : Computational geometry algorithms library. http:\/\/www.cgal.org.  CGAL: Computational geometry algorithms library. http:\/\/www.cgal.org."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634164"},{"volume-title":"A Matlab implementation for","author":"Cousins B.","key":"e_1_3_2_1_13_1","unstructured":"B. Cousins and S. Vempala . A Matlab implementation for volume approximation of convex bodies, 2014 . http:\/\/www.cc.gatech.edu\/~bcousins\/Volume.html. B. Cousins and S. Vempala. A Matlab implementation for volume approximation of convex bodies, 2014. http:\/\/www.cc.gatech.edu\/~bcousins\/Volume.html."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.09.001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102783"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217060"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187701"},{"key":"e_1_3_2_1_18_1","volume-title":"Bounding volumes","author":"Fischer K.","year":"2013","unstructured":"K. Fischer , B. G\u00e4rtner , T. Herrmann , M. Hoffmann , and S. Sch\u00f6nherr . Bounding volumes . In CGAL User and Reference Manual. CGAL Editorial Board, 4.3 edition, 2013 . K. Fischer, B. G\u00e4rtner, T. Herrmann, M. Hoffmann, and S. Sch\u00f6nherr. Bounding volumes. In CGAL User and Reference Manual. CGAL Editorial Board, 4.3 edition, 2013."},{"key":"e_1_3_2_1_19_1","volume-title":"Linear and quadratic programming solver","author":"Fischer K.","year":"2013","unstructured":"K. Fischer , B. G\u00e4rtner , S. Sch\u00f6nherr , and F. Wessendorp . Linear and quadratic programming solver . In CGAL User and Reference Manual. CGAL Editorial Board, 4.3 edition, 2013 . K. Fischer, B. G\u00e4rtner, S. Sch\u00f6nherr, and F. Wessendorp. Linear and quadratic programming solver. In CGAL User and Reference Manual. CGAL Editorial Board, 4.3 edition, 2013."},{"key":"e_1_3_2_1_20_1","volume-title":"Eigen v3","author":"Guennebaud G.","year":"2010","unstructured":"G. Guennebaud , B. Jacob , Eigen v3 , 2010 . http:\/\/eigen.tuxfamily.org. G. Guennebaud, B. Jacob, et al. Eigen v3, 2010. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2011.04.151"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199708)11:1%3C1::AID-RSA1%3E3.0.CO;2-X"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.1.84"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.2.307"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"S.\n      Liu J.\n      Zhang and \n      B.\n      Zhu\n  . Volume computation using a direct Monte Carlo method. In G. Lin editor Computing and Combinatorics volume \n  4598\n   of \n  LNCS pages \n  198\n  --\n  209\n  . \n  Springer 2007\n  .   S. Liu J. Zhang and B. Zhu. Volume computation using a direct Monte Carlo method. In G. Lin editor Computing and Combinatorics volume 4598 of LNCS pages 198--209. Springer 2007.","DOI":"10.1007\/978-3-540-73545-8_21"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.06.024"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970544727X"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.08.004"},{"volume-title":"C++ Libraries","author":"Maurer J.","key":"e_1_3_2_1_29_1","unstructured":"J. Maurer . Boost : C++ Libraries . Chapter 23. Boost Random . www.boost.org\/doc\/libs\/1_54_0\/doc\/html\/boost$_$random.html. J. Maurer. Boost: C++ Libraries. Chapter 23. Boost Random. www.boost.org\/doc\/libs\/1_54_0\/doc\/html\/boost$_$random.html."},{"key":"e_1_3_2_1_30_1","volume-title":"ANN: A library for approximate nearest neighbor searching","author":"Mount D.M.","year":"1997","unstructured":"D.M. Mount and S. Arya . ANN: A library for approximate nearest neighbor searching , 1997 . D.M. Mount and S. Arya. ANN: A library for approximate nearest neighbor searching, 1997."},{"key":"e_1_3_2_1_31_1","volume-title":"Flann: Fast library for approximate nearest neighbors","author":"Muja M.","year":"2011","unstructured":"M. Muja . Flann: Fast library for approximate nearest neighbors , 2011 . http:\/\/mloss.org\/software\/view\/143\/. M. Muja. Flann: Fast library for approximate nearest neighbors, 2011. http:\/\/mloss.org\/software\/view\/143\/."},{"key":"e_1_3_2_1_32_1","first-page":"331","volume-title":"International Conference on Computer Vision Theory and Application VISSAPP'09)","author":"Muja M.","year":"2009","unstructured":"M. Muja and D.G. Lowe . Fast approximate nearest neighbors with automatic algorithm configuration . In International Conference on Computer Vision Theory and Application VISSAPP'09) , pages 331 -- 340 . INSTICC Press , 2009 . M. Muja and D.G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In International Conference on Computer Vision Theory and Application VISSAPP'09), pages 331--340. INSTICC Press, 2009."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/304893.304993"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0447-x"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.6.1296"},{"key":"e_1_3_2_1_36_1","volume-title":"dD spatial searching","author":"Tangelder H.","year":"2013","unstructured":"H. Tangelder and A. Fabri . dD spatial searching . In CGAL User and Reference Manual. CGAL Editorial Board, 4.3 edition, 2013 . H. Tangelder and A. Fabri. dD spatial searching. In CGAL User and Reference Manual. CGAL Editorial Board, 4.3 edition, 2013."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2272578"}],"event":{"name":"SOCG'14: Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Kyoto Japan","acronym":"SOCG'14"},"container-title":["Proceedings of the thirtieth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2582112.2582133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:09Z","timestamp":1750234209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":37,"alternative-id":["10.1145\/2582112.2582133","10.1145\/2582112"],"URL":"https:\/\/doi.org\/10.1145\/2582112.2582133","relation":{},"subject":[],"published":{"date-parts":[[2014,6,8]]},"assertion":[{"value":"2014-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}