{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:24:58Z","timestamp":1729653898314,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/rivf.2012.6169860","type":"proceedings-article","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T17:51:16Z","timestamp":1332784276000},"page":"1-4","source":"Crossref","is-referenced-by-count":1,"title":["An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem"],"prefix":"10.1109","author":[{"given":"Ha Bang","family":"Ban","sequence":"first","affiliation":[]},{"given":"Duc Nghia","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.09.009"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00102-2"},{"year":"0","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195125"},{"key":"7","first-page":"36","article-title":"Path, Tree and minimum latency tour","author":"chaudhuri","year":"0","journal-title":"Proceedings of FOCS 2003"},{"key":"6","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1137\/07068151X","article-title":"A Faster, Better Approximation Algorithm for the Minimum Latency Problem","volume":"37","author":"archer","year":"2007","journal-title":"J SIAM"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585867"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301432"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060650"},{"key":"8","first-page":"9","article-title":"Improved genetic algorithm for minimum latency problem","author":"ban","year":"0","journal-title":"Proc ACM SOICT 2010"},{"year":"0","key":"11"},{"year":"0","key":"12"}],"event":{"name":"Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)","start":{"date-parts":[[2012,2,27]]},"location":"Ho Chi Minh City, Vietnam","end":{"date-parts":[[2012,3,1]]}},"container-title":["2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6168956\/6169815\/06169860.pdf?arnumber=6169860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T12:08:26Z","timestamp":1497960506000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6169860\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/rivf.2012.6169860","relation":{},"subject":[],"published":{"date-parts":[[2012,2]]}}}