{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T19:02:10Z","timestamp":1761937330161,"version":"build-2065373602"},"reference-count":7,"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\/bf01553897","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T22:07:35Z","timestamp":1114034855000},"page":"365-393","source":"Crossref","is-referenced-by-count":16,"title":["Scheduling multihop CDMA networks in the presence of secondary conflicts"],"prefix":"10.1007","volume":"4","author":[{"given":"M. J.","family":"Post","sequence":"first","affiliation":[]},{"given":"A. S.","family":"Kershenbaum","sequence":"additional","affiliation":[]},{"given":"P. E.","family":"Sarachik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01553897_CR1","doi-asserted-by":"crossref","unstructured":"B. Hajek and G. Sasaki, Link Scheduling in Polynomial Time,IEEE Trans. Inform. Theory, to appear.","DOI":"10.1109\/18.21215"},{"key":"BF01553897_CR2","volume-title":"Computer and Job Shop Scheduling Theory","author":"W. H. Kohler","year":"1976","unstructured":"W. H. Kohler and K. Steiglitz, Enumerative and Iterative Computational Approaches, inComputer and Job Shop Scheduling Theory (E. Coffman, ed.), New York, Wiley, 1976."},{"key":"BF01553897_CR3","unstructured":"R. G. Ogier, A Decomposition Method for Optimal Link Scheduling,Proc. 24th Allerton Conf., Oct. 1986."},{"key":"BF01553897_CR4","unstructured":"M. J. Post, P. E. Sarachik, and A. S. Kershenbaum, A Biased Greedy Algorithm for Scheduling Multi-Hop Radio Networks,Proc. 1985 Conf. Inform. Sci. and Systems, Mar. 1985, pp. 564\u2013572."},{"key":"BF01553897_CR5","doi-asserted-by":"crossref","unstructured":"M. J. Post, A. S. Kershenbaum, and P. E. Sarachik, A Distributed Evolutionary Algorithm for Reorganizing Network Communications,Proc. MILCOM, Sept. 1986, pp. 133\u2013139.","DOI":"10.1109\/MILCOM.1985.4794952"},{"key":"BF01553897_CR6","unstructured":"J. E. Wieselthier and A. Ephremides, A Distributed Reservation Scheme for Spread Spectrum Multiple Access Channels,GLOBCOM, 1983."},{"key":"BF01553897_CR7","unstructured":"J. E. Wieselthier, A. Ephremides, and J. A. B. Tarr, A Distributed Reservation-Based CDMA Protocol That Does Not Require Feedback Information,IEEE Trans. Comm., to appear."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553897.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553897\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T01:16:39Z","timestamp":1586222199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":7,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553897"],"URL":"https:\/\/doi.org\/10.1007\/bf01553897","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}