{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:24:22Z","timestamp":1730193862321,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"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":[],"published-print":{"date-parts":[[2021,12,21]]},"DOI":"10.1109\/acit53391.2021.9677316","type":"proceedings-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T21:26:35Z","timestamp":1642454795000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic for the Consecutive Block Minimization Algorithms And Results"],"prefix":"10.1109","author":[{"given":"Zoubir","family":"Layouni","sequence":"first","affiliation":[]},{"given":"Muhammad","family":"Suhail","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00186-0"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"carsten","year":"1994","journal-title":"Journal of ACM"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.281"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00435-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/185675.306789"},{"journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization","year":"1985","author":"lawler","key":"ref7"},{"key":"ref2","article-title":"Worst case analysis of a new heuristic for the travelling saleslman problem","author":"christofides","year":"1976","journal-title":"Report 338"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00078-X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0206004"}],"event":{"name":"2021 22nd International Arab Conference on Information Technology (ACIT)","start":{"date-parts":[[2021,12,21]]},"location":"Muscat, Oman","end":{"date-parts":[[2021,12,23]]}},"container-title":["2021 22nd International Arab Conference on Information Technology (ACIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9677036\/9677041\/09677316.pdf?arnumber=9677316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:57:50Z","timestamp":1652201870000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9677316\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,21]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/acit53391.2021.9677316","relation":{},"subject":[],"published":{"date-parts":[[2021,12,21]]}}}