{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:00Z","timestamp":1725497160989},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_16","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T09:55:58Z","timestamp":1196934958000},"page":"154-165","source":"Crossref","is-referenced-by-count":0,"title":["An Equivalent Version of the Caccetta-H\u00e4ggkvist Conjecture in an Online Load Balancing Problem"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Monti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Aichholzer, O., Aurenhammer, F., Rote, G.: Optimal graph orientation with storage applications. SFB Report Series\u00a051, TU-Graz (1995)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y. Azar","year":"1998","unstructured":"Azar, Y.: On-line Load Balancing. In: Fiat, A., W\u00f6ginger, G.J. (eds.) Online Algorithms. LNCS, vol.\u00a01442, Springer, Heidelberg (1998)"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)90153-8","volume":"130","author":"Y. Azar","year":"1994","unstructured":"Azar, Y., Broder, A., Karlin, A.: On-line load balancing. Theoretical Computer Science\u00a0130(1), 73\u201384 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jagm.1995.0799","volume":"22","author":"Y. Azar","year":"1997","unstructured":"Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. Journal of Algorithms\u00a022, 93\u2013110 (1997)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1137\/S0097539798346135","volume":"31","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Freund, A., Naor, J.: On-line load balancing in a hierarchical server topology. SIAM Journal on Computing\u00a031(2), 527\u2013549 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.4064\/fm-69-3-227-231","volume":"69","author":"M. Behzad","year":"1970","unstructured":"Behzad, M., Chartrand, G., Wall, C.: On minimal regular digraph with given girth. Fundamenta Mathematicae\u00a069, 227\u2013231 (1970)","journal-title":"Fundamenta Mathematicae"},{"key":"16_CR7","unstructured":"Caccetta, L., H\u00e4ggkvist, R.: On minimal regular digraph with given girth. In: Proc. of 9th S-E Conf. Combinatorics, Graph Theory and Computing, pp. 181\u2013187 (1978)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.jda.2006.02.001","volume":"5","author":"P. Crescenzi","year":"2007","unstructured":"Crescenzi, P., Gambosi, G., Nicosia, G., Penna, P., Unger, W.: On-line load balancing made simple: Greedy strikes back. Journal of Discrete Algorithms\u00a05(1), 162\u2013175 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11558989_2","volume-title":"Peer-to-Peer Systems IV","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Schmid, S., Wattenhofer, R.: A self-repairing peer-to-peer system resilient to dynamical adversarial churn. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol.\u00a03640, pp. 13\u201323. Springer, Heidelberg (2005)"},{"key":"16_CR10","unstructured":"Monti, A., Penna, P., Silvestri, R.: An Equivalent Version of the Caccetta-H\u00e4ggkvist Conjecture in an Online Load Balancing Problem (2007), Technical report available at \n                  \n                    http:\/\/www.dia.unisa.it\/~penna"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a036, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jctb.1998.1839","volume":"74","author":"J. Shen","year":"1998","unstructured":"Shen, J.: Directed triangles in digraphs. Journal of Combinatorial Theory\u00a074, 405\u2013407 (1998)","journal-title":"Journal of Combinatorial Theory"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s003730200048","volume":"18","author":"J. Shen","year":"2003","unstructured":"Shen, J.: On the Caccetta-H\u00e4ggkvist conjecture. Graphs and Combinatorics\u00a018(3), 645\u2013654 (2003)","journal-title":"Graphs and Combinatorics"},{"key":"16_CR14","unstructured":"Sullivan, B.D.: A Summary of Results and Problems Related to the Caccetta-H\u00e4ggkvist Conjecture. In: ARCC Workshop: The Caccetta-Haggkvist conjecture (2006), available at \n                  \n                    http:\/\/www.aimath.org\/pastworkshops\/caccetta.html"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:31Z","timestamp":1619505751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_16","relation":{},"subject":[]}}