{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,12]],"date-time":"2026-04-12T07:35:27Z","timestamp":1775979327194,"version":"3.50.1"},"reference-count":9,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5215,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Each vertex of a graph initially may contain an object of a known type. A final state, specifying the type of object desired at each vertex, is also given. A single vehicle of unit capacity is available for shipping objects among the vertices. The swapping problem is to compute a shortest route such that a vehicle can accomplish the rearrangement of the objects while following this route. We exhibit several structural properties of shortest routes and develop polynomial approximation algorithms that are variations of a well\u2010known \u201cpatching\u201d algorithm for the traveling salesman problem. We prove tight constant performance guarantees for these algorithms and note as a side product that these bounds hold and are tight also for the latter problem.<\/jats:p>","DOI":"10.1002\/net.3230220408","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:49:15Z","timestamp":1178974155000},"page":"419-433","source":"Crossref","is-referenced-by-count":68,"title":["The swapping problem"],"prefix":"10.1002","volume":"22","author":[{"given":"S.","family":"Anily","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Hassin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0217053"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588956"},{"key":"e_1_2_1_4_2","first-page":"66","article-title":"Ensemble motion planning in trees","volume":"30","author":"Frederickson G. N.","year":"1989","journal-title":"Proc. FOCS"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0207017"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.5.655"},{"key":"e_1_2_1_7_2","unstructured":"J. A.Hoogeveen(1990) Analysis of Christofides' heuristic: Some paths are more difficult than cycles. CWI report BS\u2010R9005 Amsterdam."},{"key":"e_1_2_1_8_2","volume-title":"The Traveling Salesman Problem","author":"Johnson D. S.","year":"1985"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.15807\/jorsj.33.354","article-title":"Heuristic algorithms for the single vehicle dial\u2010a\u2010ride problem","volume":"33","author":"Kubo M.","year":"1990","journal-title":"J. Operational Res. Soc. Jpn."},{"key":"e_1_2_1_10_2","first-page":"133","article-title":"Analysis of an O(n2) heuristic for the single vehicle many\u2010to\u2010many Euclidean dial\u2010a\u2010ride problem","volume":"117","author":"Psarfatis H.","year":"1983","journal-title":"Transportation Sci."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T11:14:00Z","timestamp":1698059640000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["10.1002\/net.3230220408"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220408","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}