{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T10:12:22Z","timestamp":1784110342807,"version":"3.55.0"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1109\/tc.2013.2295609","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:45:20Z","timestamp":1391190320000},"page":"600-613","source":"Crossref","is-referenced-by-count":66,"title":["Approximation Algorithms for Min-Max Cycle Cover Problems"],"prefix":"10.1109","volume":"64","author":[{"given":"Wenzheng","family":"Xu","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 51006, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weifa","family":"Liang","sequence":"additional","affiliation":[{"name":"Research School of Computer Science , The Australian National University, North Road, CSIT Building, Canberra, ACT 0200, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaola","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 51006, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566993"},{"key":"ref12","article-title":"Data Structures for Weighted Matching and Nearest Common Ancestors with Linking","author":"gabow","year":"1990","journal-title":"Proc First Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.140"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.03.023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.09.014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20434"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1976.6"},{"key":"ref33","article-title":"Joint Mobile Energy Replenishment and Data Gathering in Wireless Rechargeable Sensor Networks","author":"zhao","year":"2011","journal-title":"Proc 23rd Int'l Teletraffic Congress (ITC)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2012.6502505"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.2.132.118"},{"key":"ref17","article-title":"Minimizing Data Collection Latency in Wireless Sensor Network with Multiple Mobile Elements","author":"kim","year":"2012","journal-title":"Proc IEEE InfoCom"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22935-0_26"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2011.6115315"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2011.6089076"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934919"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.06.012"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.22"},{"key":"ref25","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683095"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536269"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.124"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SECON.2012.6275766"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2185831"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/DCOSS.2012.17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2012.6231157"},{"key":"ref7","author":"diestel","year":"2000","journal-title":"Graph Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1070.0209"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)89161-5"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","article-title":"Time Constrained Routing and Scheduling","volume":"8","author":"desrosiers","year":"1995","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"ref5","article-title":"Solving Min-Max Multi-Depot Vehicle Routing Problem","author":"carlsson","year":"2007","journal-title":"Proc FIELDS Workshop Global Optimization"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7031983\/06690147.pdf?arnumber=6690147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T16:39:05Z","timestamp":1682613545000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6690147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":34,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tc.2013.2295609","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}