{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:30:28Z","timestamp":1747906228173},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616276"},{"type":"electronic","value":"9783540706366"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0024753","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:17:56Z","timestamp":1132384676000},"page":"594-601","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minimum length scheduling of precedence constrained messages in distributed systems"],"prefix":"10.1007","author":[{"given":"Piera","family":"Barcaccia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio A.","family":"Bonuccelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"76_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahija","year":"1992","unstructured":"R.K. Ahija, T.L. Magnanti and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, New York, 1992."},{"key":"76_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/90.311622","volume":"2","author":"P. Barcaccia","year":"1994","unstructured":"P. Barcaccia and M.A. Bonuccelli. \u201cPolynomial time optimal algorithms for time slot assignment of variable bandwidth systems\u201d. ACM\/IEEE Transactions on Networking, 2, 247\u2013251, 1994.","journal-title":"ACM\/IEEE Transactions on Networking"},{"key":"76_CR3","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TCOM.1981.1095028","volume":"29","author":"G. Bongiovanni","year":"1981","unstructured":"G. Bongiovanni, D. Coppersmith and C.K. Wong. \u201cAn optimal time slot assignment algorithm for a SS\/TDMA system with variable number of transponders\u201d. IEEE Transactions on Communication, 29, 721\u2013726, 1981.","journal-title":"IEEE Transactions on Communication"},{"key":"76_CR4","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/26.87220","volume":"39","author":"M.A. Bonuccelli","year":"1991","unstructured":"M.A. Bonuccelli, I.S. Gopal and C.K. Wong. \u201cIncremental time slot assignment in SS\/TDMA satellite systems\u201d. IEEE Transactions on Communication, 39, 1147\u20131156, 1991.","journal-title":"IEEE Transactions on Communication"},{"key":"76_CR5","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1109\/26.31186","volume":"37","author":"M.A. Bonuccelli","year":"1989","unstructured":"M.A. Bonuccelli. \u201cA fast time slot assignment algorithm for TDM hierarchical switching systems\u201d. IEEE Transactions on Communication, 37, 870\u2013874, 1989.","journal-title":"IEEE Transactions on Communication"},{"key":"76_CR6","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/TCOM.1981.1095097","volume":"29","author":"G. Bongiovanni","year":"1981","unstructured":"G. Bongiovanni, D.T. Tang and C.K. Wong. \u201cA general multibeam satellite switching algorithm\u201d IEEE Transactions on Communication, 29, 1025\u20131036, 1981.","journal-title":"IEEE Transactions on Communication"},{"key":"76_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/26.275310","volume":"42","author":"W.T. Chen","year":"1994","unstructured":"W.T. Chen, P.R. Sheu and J.H. Yu. \u201cTime slot assignment in TDM multicast switching systems\u201d. IEEE Transactions on Communication, 42, 149\u2013165, 1994.","journal-title":"IEEE Transactions on Communication"},{"key":"76_CR8","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979."},{"key":"76_CR9","unstructured":"H. Gabow, T. Nishizeki, O. Kariv, D. Leven and O. Terada. \u201cAlgorithms for edge coloring graphs\u201d. Technical Report 41\/85, University of Colorado, 1985."},{"key":"76_CR10","volume-title":"Advanced Computer Architecture","author":"K. Hwang","year":"1993","unstructured":"K. Hwang. Advanced Computer Architecture. McGraw-Hill Book Company, New York, 1993."}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:35:31Z","timestamp":1587342931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024753"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616276","9783540706366"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0024753","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}