{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:16Z","timestamp":1751282836806},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":[[1988,11]]},"DOI":"10.1007\/bf01762116","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T06:22:38Z","timestamp":1118902958000},"page":"223-245","source":"Crossref","is-referenced-by-count":27,"title":["Data transfers in networks"],"prefix":"10.1007","volume":"3","author":[{"given":"Hyeong -Ah","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Louis","family":"Hakimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01762116_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty,Graph Theory with Applications, American Elsevier, New York, 1976."},{"key":"BF01762116_CR2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"E. L. Lawler","year":"1978","unstructured":"E. L. Lawler and J. Labetoulle, On pre-emptive scheduling of unrelated parallel processors by linear programming,J. Assoc. Comput. Mach.,25 (1978), 612\u2013619.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01762116_CR3","volume-title":"SS\/TDMA satellite communication withk-permutation switching modes, Preprint","author":"J. L. Lewandowski","year":"1982","unstructured":"J. L. Lewandowski and C. L. Liu, SS\/TDMA satellite communication withk-permutation switching modes, Preprint, Department of Computer Science, University of Illinois, Urbana, 1982."},{"key":"BF01762116_CR4","volume-title":"An algorithmic proof of a generalization of the Birkhoff-von Neumann theorem, Preprint","author":"C. L. Liu","year":"1982","unstructured":"C. L. Liu, L. Liu, and J. L. Lewandowski, An algorithmic proof of a generalization of the Birkhoff-von Neumann theorem, Preprint, Department of Computer Science, University of Illinois, Urbana, 1982."},{"key":"BF01762116_CR5","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, An optimum time slot assignment algorithm for an SS\/TDMA system with variable number of transponders,IEEE Trans. Comm.,29 (1981), 721\u2013726.","journal-title":"IEEE Trans. Comm."},{"key":"BF01762116_CR6","doi-asserted-by":"crossref","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, A general multibeam satellite switching algorithm,IEEE Trans. Comm.,29 (1981), 1025\u20131036.","journal-title":"IEEE Trans. Comm."},{"key":"BF01762116_CR7","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, and C. K. Wong, An optimal switching algorithm for multibeam satellite systems with variable bandwidth beams,IEEE Trans. Comm.,30 (1982), 2475\u20132481.","journal-title":"IEEE Trans. Comm."},{"key":"BF01762116_CR8","volume-title":"Ph.D. Dissertation","author":"I. S. Gopal","year":"1982","unstructured":"I. S. Gopal, Scheduling algorithm for multibeam communication satellite, Ph.D. Dissertation, Department of Electrical Engineering, Columbia University, New York, 1982."},{"key":"BF01762116_CR9","unstructured":"A. K. Sirha, A model for TDMA burst assignment and scheduling,Comsat. Tech. Rev.,6 (1975)."},{"key":"BF01762116_CR10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/PROC.1977.10493","volume":"65","author":"Y. Ito","year":"1977","unstructured":"Y. Ito, Y. Urano, T. Muratani, and M. Yamaguchi, Analysis of switching matrix for an SS\/TDMA system,Proc. IEEE,65 (1977), 411\u2013419.","journal-title":"Proc. IEEE"},{"key":"BF01762116_CR11","first-page":"44","volume-title":"Topics in Combinatorial Mathematics","author":"C. L. Liu","year":"1972","unstructured":"C. L. Liu,Topics in Combinatorial Mathematics, Mathematical Association of America, Washington, D.C., 1972, pp. 44\u201351."},{"key":"BF01762116_CR12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"D. K\u00f6nig, \u00dcber Graphen und ihre Anwendug auf Determinaten Theorie und Mengenlehre,Math. Ann.,77 (1916), 453\u2013465.","journal-title":"Math. Ann."},{"key":"BF01762116_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190100202","volume":"10","author":"S. L. Hakimi","year":"1986","unstructured":"S. L. Hakimi and O. Kariv, On a generalization of edge-coloring in graphs,J. Graph Theory,10 (1986), 139\u2013154.","journal-title":"J. Graph Theory"},{"key":"BF01762116_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/978-94-011-7557-9_18","volume-title":"Combinatorial Programming Methods and Applications","author":"D. Werra de","year":"1975","unstructured":"D. de Werra, A few remarks on chromatic scheduling, inCombinatorial Programming Methods and Applications (B. Roy, ed.), Reidel, Dordrecht, 1975, pp. 337\u2013342."},{"key":"BF01762116_CR15","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R. Cole","year":"1982","unstructured":"R. Cole and J. Hopcroft, On edge-coloring bipartite graphs,SIAM J. Comput.,11 (1982), 540\u2013546.","journal-title":"SIAM J. Comput."},{"key":"BF01762116_CR16","doi-asserted-by":"crossref","unstructured":"E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and A. S. LaPaugh, Scheduling file transfers,SIAM J. Comput.,14 (1985).","DOI":"10.1137\/0214054"},{"key":"BF01762116_CR17","volume-title":"Computers and Intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979."},{"key":"BF01762116_CR18","unstructured":"B. Hajek, Link schedules, flows, and the multichromatic index of graphs,Proceedings of the Conference on Information Science and Systems, Princeton, 1984."},{"key":"BF01762116_CR19","unstructured":"H.-A. Choi and S. L. Hakimi, Scheduling data transfers in networks with pre-emption,Proceedings of the 23rd Allerton Conference on Communication, Control, and Computing, Monticello, IL, 1985."},{"key":"BF01762116_CR20","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1137\/0216013","volume":"16","author":"H.-A. Choi","year":"1987","unstructured":"H.-A. Choi and S. L. Hakimi, Scheduling file transfers for trees and odd cycles,SIAM J. Comput.,16 (1987), 162\u2013168.","journal-title":"SIAM J. Comput."},{"key":"BF01762116_CR21","unstructured":"H.-A. Choi and S. L. Hakimi, Data transfers in networks with transceivers,Networks (to appear)."},{"key":"BF01762116_CR22","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1109\/TCOM.1985.1096336","volume":"23","author":"I. S. Gopal","year":"1985","unstructured":"I. S. Gopal and C. K. Wong, Minimizing the number of switchings in a multibeam satellite system,IEEE Trans. Commun.,23 (1985), 497\u2013501.","journal-title":"IEEE Trans. Commun."},{"key":"BF01762116_CR23","volume-title":"Ph.D. Dissertation","author":"H.-A. Choi","year":"1986","unstructured":"H.-A. Choi, Scheduling data transfers in networks, Ph.D. Dissertation, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 1986."},{"key":"BF01762116_CR24","unstructured":"B. Hajek and G. Sasaki, Link schedules in polynomial time, Preprint, Department of Electrical and Computer Engineering and the Coordinated Science Laboratory, University of Illinois, Urbana."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762116.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01762116\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01762116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T12:41:43Z","timestamp":1557319303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01762116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":24,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["BF01762116"],"URL":"https:\/\/doi.org\/10.1007\/bf01762116","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}