{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:54Z","timestamp":1725570774216},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642166433"},{"type":"electronic","value":"9783642166440"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16644-0_10","type":"book-chapter","created":{"date-parts":[[2010,11,29]],"date-time":"2010-11-29T11:58:42Z","timestamp":1291031922000},"page":"99-111","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive Message Ferry Route (aMFR) for Partitioned MANETs"],"prefix":"10.1007","author":[{"given":"Ting","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chor Ping","family":"Low","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"key":"10_CR2","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, Inc., Chichester (1974)"},{"issue":"6","key":"10_CR3","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"16","author":"E. Balas","year":"2006","unstructured":"Balas, E.: The Prize Collecting Traveling Salesman Problem. Networks\u00a016(6), 621\u2013636 (2006)","journal-title":"Networks"},{"key":"10_CR4","first-page":"163","volume-title":"Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC 1994)","author":"A. Blum","year":"1994","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The Minimum Latency Problem. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC 1994), pp. 163\u2013171. ACM, New York (1994)"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0743-7315(02)00033-3","volume":"63","author":"Q. Li","year":"2003","unstructured":"Li, Q., Rus, D.: Communication in Disconnected Ad Hoc Networks Using Message Relay. J. Parallel Distrib. Comput.\u00a063(1), 75\u201386 (2003)","journal-title":"J. Parallel Distrib. Comput."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Merz, P., Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 159\u2013164 (April 1997)","DOI":"10.1109\/ICEC.1997.592288"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various Optimizers for Single-Stage Production. Naval Research Logistics Quarterly\u00a03, 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1132905.1132910","volume-title":"Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2006)","author":"M.M.B. Tariq","year":"2006","unstructured":"Tariq, M.M.B., Ammar, M., Zegura, E.: Message Ferry Route Design for Sparse Ad Hoc Networks with Mobile Nodes. In: Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2006), pp. 37\u201348. ACM, New York (2006)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Low, C.P., Ng, J.M., Wang, T.: An Efficient Group Partition Prediction Scheme for MANETs. In: Proceedings of the 2009 IEEE Wireless Communications and Networking Conference (WCNC 2009), pp. 1\u20136 (2009)","DOI":"10.1109\/WCNC.2009.4917572"},{"key":"10_CR10","unstructured":"Zhao, W., Ammar, M.: Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks. In: Proc. of the Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), Washington, DC, USA, pp. 308\u2013314 (2003)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Mobile Lightweight Wireless Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16644-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T10:12:17Z","timestamp":1553249537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16644-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642166433","9783642166440"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16644-0_10","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2010]]}}}