{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:34Z","timestamp":1750306294594,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T00:00:00Z","timestamp":1467158400000},"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":[[2016,6,29]]},"DOI":"10.1145\/2910674.2910729","type":"proceedings-article","created":{"date-parts":[[2016,11,18]],"date-time":"2016-11-18T15:41:05Z","timestamp":1479483665000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for the Vehicle Routing Problem with Time Windows, Capacity Constraint and Unlimited Number of Vehicles"],"prefix":"10.1145","author":[{"given":"Bogdan","family":"Armaselu","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_1_2_1","first-page":"441","volume-title":"Symposium on new directions and recent results in algorithms and complexity","author":"Christofides N.","unstructured":"N. Christofides . Worst-case analysis of a new heuristic for the traveling salesman problem . Symposium on new directions and recent results in algorithms and complexity , page 441 . N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Symposium on new directions and recent results in algorithms and complexity, page 441."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.4.626"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007385"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022044"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/WiCom.2008.1502"}],"event":{"name":"PETRA '16: 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments","acronym":"PETRA '16","location":"Corfu Island Greece"},"container-title":["Proceedings of the 9th ACM International Conference on PErvasive Technologies Related to Assistive Environments"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910674.2910729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2910674.2910729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:09Z","timestamp":1750221549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910674.2910729"}},"subtitle":["Poster Paper"],"short-title":[],"issued":{"date-parts":[[2016,6,29]]},"references-count":6,"alternative-id":["10.1145\/2910674.2910729","10.1145\/2910674"],"URL":"https:\/\/doi.org\/10.1145\/2910674.2910729","relation":{},"subject":[],"published":{"date-parts":[[2016,6,29]]},"assertion":[{"value":"2016-06-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}