{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:15:51Z","timestamp":1648876551340},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553895","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T18:07:35Z","timestamp":1114020455000},"page":"329-341","source":"Crossref","is-referenced-by-count":0,"title":["A correction algorithm for token-passing sequences in mobile communication networks"],"prefix":"10.1007","volume":"4","author":[{"given":"Yaron I.","family":"Gold","sequence":"first","affiliation":[]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01553895_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J. Bearwood","year":"1959","unstructured":"Bearwood, J., J. H. Halton, and J. M. Hammersley, The shortest path through many points,Math. Proc. Cambridge Philos. Soc.,55 (1959), pp. 299\u2013327.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"BF01553895_CR2","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/TCOM.1979.1094529","volume":"27","author":"I. Chlamtac","year":"1979","unstructured":"Chlamtac, I., W. R. Franta, and K. D. Levin, BRAM: the broadcast recognizing access method,IEEE Trans. Comm.,27 (1979), pp. 1183\u20131190.","journal-title":"IEEE Trans. Comm."},{"key":"BF01553895_CR3","unstructured":"Christofides, N., Worst Case Analysis of a New Heuristic for the Traveling Salesman Problem, Management Sciences Research Report 388, Carnegie-Mellon, February 1976."},{"key":"BF01553895_CR4","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.,Graph Algorithms, Computer Science Press, Rockville, MD, 1979."},{"key":"BF01553895_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1112\/S0025579300000784","volume":"2","author":"L. Few","year":"1955","unstructured":"Few, L., The shortest path and shortest road throughn points,Mathematika,2 (1955), pp. 141\u2013144.","journal-title":"Mathematika"},{"key":"BF01553895_CR6","volume-title":"Computers and Intractability","author":"N. R. Garey","year":"1979","unstructured":"Garey, N. R., and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979."},{"key":"BF01553895_CR7","unstructured":"Gold, Y. I., and W. R. Franta, An efficient scheduling function for distributed multiplexing of a communication-bus shared by a large number of users,Proc. Int. Conf. Comm., ICC '82, Philadelphia, PA, June 1982, pp. 5c.5.1\u20135c.5.9."},{"key":"BF01553895_CR8","first-page":"83","volume":"7","author":"Y. I. Gold","year":"1983","unstructured":"Gold, Y. I., and W. R. Franta, An efficient collision-free protocol for prioritized access-control of cable or radio channels,Comput. Networks,7 (1983), pp. 83\u201398.","journal-title":"Comput. Networks"},{"issue":"No. 3","key":"BF01553895_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01782774","volume":"2","author":"Y. I. Gold","year":"1987","unstructured":"Gold, Y. I., and S. Moran, Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network,Distribut. Comput.,2 (1987), No. 3, pp. 139\u2013148.","journal-title":"Distribut. Comput."},{"key":"BF01553895_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1983.1676198","volume":"32","author":"Y. I. Gold","year":"1983","unstructured":"Gold, Y. I., W. R. Franta, and S. Moran, A distributed channel-access protocol for fully-connected networks with mobile nodes,IEEE Trans. Comput.,32 (1983), pp. 133\u2013147.","journal-title":"IEEE Trans. Comput."},{"key":"BF01553895_CR11","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1287\/opre.28.3.694","volume":"28","author":"B. Golden","year":"1980","unstructured":"Golden B., L. Bodin, T. Doyle, and W. Stewart Jr., Approximate Traveling Salesman algorithms,Oper. Res.,28 (1980), pp. 694\u2013711.","journal-title":"Oper. Res."},{"key":"BF01553895_CR12","volume-title":"Geometrical Probability","author":"M. G. Kendall","year":"1963","unstructured":"Kendall, M. G., and P. A. P. Moran,Geometrical Probability, Griffin, London, 1963."},{"key":"BF01553895_CR13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal","year":"1956","unstructured":"Kruskal, J. B., On the shortest spanning subtree of a graph and the Traveling Salesman Problem, Proc.Amer. Math. Soc.,7 (1956), pp. 48\u201350.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF01553895_CR14","unstructured":"Liu, T., L. Li, and W. R. Franta, A decentralized conflict-free protocol, GBRAM for large scale local networks,Proc. MBS Comput. Networking Symp., December 8, 1981, pp. 39\u201354."},{"key":"BF01553895_CR15","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1109\/TCOM.1980.1094698","volume":"28","author":"F. A. Tobagi","year":"1980","unstructured":"Tobagi, F. A., Multi-access protocols in packet communication systems,IEEE Trans. Comm.,28 (1980), pp. 468\u2013488.","journal-title":"IEEE Trans. Comm."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553895.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553895\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:21:13Z","timestamp":1556878873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":15,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553895"],"URL":"https:\/\/doi.org\/10.1007\/bf01553895","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}