{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:02:53Z","timestamp":1693134173385},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5483-4","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"49-57","source":"Crossref","is-referenced-by-count":14,"title":["Scheduling in Switching Networks with Set-Up Delays"],"prefix":"10.1007","volume":"9","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timos","family":"Aslanidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Milis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","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, ?Anoptimal time slot assignment for an SS\/TDMA system with variable number of transponders,? IEEE Trans. Commun., vol. 29, pp. 721?726, 1981.","journal-title":"IEEE Trans. Commun."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1011441109660","volume":"5","author":"P. Crescenzi","year":"2001","unstructured":"P. Crescenzi, X. Deng, and C.H. Papadimitriou, ?On approximating a scheduling problem,? Journal of Combinatorial Optimization, vol. 5, pp. 287?297, 2001.","journal-title":"Journal of Combinatorial Optimization"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai, and A. Shamir, ?On the complexity of timetable and multicommodity flow problems,? SIAM J. Comput., vol. 5,pp. 691?703, 1976.","journal-title":"SIAM J. Comput."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"2475","DOI":"10.1109\/TCOM.1982.1095433","volume":"30","author":"I.S. Gopal","year":"1982","unstructured":"I.S. Gopal, G. Bongiovanni, M.A. Bonucelli, D.T. Tang, andC.K. Wong, ?An optimal switching algorithm for multibeam satellite systemswith variable bandwidth beams,? IEEE Trans. Commun., vol. 30, pp. 2475?2481, 1982.","journal-title":"IEEE Trans. Commun"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TCOM.1985.1096336","volume":"33","author":"I.S. Gopal","year":"1985","unstructured":"I.S. Gopal and C.K. Wong, ?Minimizing the number of switchings in an SS\/TDMA system,? IEEE Trans. Commun., vol. 33, pp. 497?501, 1985.","journal-title":"IEEE Trans. Commun."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"M. Goudreau, K. Lang, S.B. Rao, T. Suel, and T. Tsantilas, ?Towards efficiency and portability: Programming with the BSP model,? in Proc. SPAA,1996.","DOI":"10.1145\/237502.237503"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1109\/TCOM.1979.1094297","volume":"27","author":"T. Inukai","year":"1979","unstructured":"T. Inukai, ?An efficient SS\/TDMA time slot assignment algorithm,? IEEE Trans. Commun., vol. 27, pp. 1449?1455, 1979.","journal-title":"IEEE Trans. Commun."},{"key":"CR8","unstructured":"K.S. Natarajan and S.B. Calo, ?Time slot assignment in an SS\/TDMA system with minimum switchings,? IBM Res. Rep., 1981."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"L.G. Valiant, ?A bridging model for parallel computation,? Comm. ACM, vol. 33, pp. 103?111, 1990.","journal-title":"Comm. ACM"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5483-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5483-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5483-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:09Z","timestamp":1559276289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5483-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5483"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5483-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}