{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:55Z","timestamp":1750221235778,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T00:00:00Z","timestamp":1530835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K18095"],"award-info":[{"award-number":["15K18095"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,6]]},"DOI":"10.1145\/3205651.3208316","type":"proceedings-article","created":{"date-parts":[[2018,7,6]],"date-time":"2018-07-06T19:30:44Z","timestamp":1530905444000},"page":"1813-1820","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Towards bundling minimal trees in polygonal maps"],"prefix":"10.1145","author":[{"given":"Victor","family":"Parque","sequence":"first","affiliation":[{"name":"Waseda University, Tokyo, Japan and Egypt-Japan University of Science and Technology, Borg Al Arab, Alexandria, Egypt"}]},{"given":"Tomoyuki","family":"Miyashita","sequence":"additional","affiliation":[{"name":"Waseda University, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"J. Vojt\u011bch and M. K\u00f6ssler. O minim\u00e1ln\u00edch grafech obsahuj\u00edc\u00edch n dan\u00fdch bod\u016f. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky a fysiky 063.8 pp. 223--235 1934.  J. Vojt\u011bch and M. K\u00f6ssler. O minim\u00e1ln\u00edch grafech obsahuj\u00edc\u00edch n dan\u00fdch bod\u016f. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky a fysiky 063.8 pp. 223--235 1934.","DOI":"10.21136\/CPMF.1934.122548"},{"volume-title":"Oxford University Press","year":"1941","author":"Robbins H.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"H. Zhang D. Ye and W Guo. A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles. INTEGRATION the VLSI journal Vol. 55 pp. 162--175 2016.  H. Zhang D. Ye and W Guo. A heuristic for constructing a rectilinear Steiner tree by reusing routing resources over obstacles. INTEGRATION the VLSI journal Vol. 55 pp. 162--175 2016.","DOI":"10.1016\/j.vlsi.2016.06.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00256-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2007.10.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90092-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2013.08.001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2009.01.011"},{"key":"e_1_3_2_1_9_1","unstructured":"R. Falud. Building Wireless Sensor Networks. O'Reilly Media Sebastapol 4th edition 2014.  R. Falud. Building Wireless Sensor Networks. O'Reilly Media Sebastapol 4th edition 2014."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.07.007"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.03.001"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2015.02.001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2015.04.023"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.133"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.135"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2068462.2068638"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2011.233"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2015551.2015650"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01450.x"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/571647.571648"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"volume-title":"MIT Press","year":"1993","author":"Cormen T.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","first-page":"49","volume-title":"Proceedings of the Workshop on Reasoning, Representation, and Learning in Computer Games, IJCAI","author":"Kallmann M.","year":"2005"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.58"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140304"},{"key":"e_1_3_2_1_27_1","first-page":"893","volume-title":"Higashi. Optimisation of Bundled Routes. 16th International Conference on Geometry and Graphics","author":"Parque Victor","year":"2014"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40638-017-0079-x"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/RCAR.2017.8311950"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00063"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/BIGCOMP.2017.7881738"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2014.6973948"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/978-3-319-12637-1_38","volume-title":"Neural Information Processing","author":"Parque Victor","year":"2014"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2014.6974319"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSPIT.2016.7886013"}],"event":{"name":"GECCO '18: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Kyoto Japan","acronym":"GECCO '18"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205651.3208316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3205651.3208316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:15Z","timestamp":1750212435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3205651.3208316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,6]]},"references-count":35,"alternative-id":["10.1145\/3205651.3208316","10.1145\/3205651"],"URL":"https:\/\/doi.org\/10.1145\/3205651.3208316","relation":{},"subject":[],"published":{"date-parts":[[2018,7,6]]},"assertion":[{"value":"2018-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}