{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:45Z","timestamp":1725573405046},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_62","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"614-623","source":"Crossref","is-referenced-by-count":0,"title":["On Bounded Load Routings for Modeling k-Regular Connection Topologies"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K.M.J. Bontridder De","year":"2003","unstructured":"De Bontridder, K.M.J., Hald\u00f3rsson, B.V., Hald\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Programming\u00a098, 477\u2013491 (2003)","journal-title":"Math. Programming"},{"key":"62_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<179::AID-NET4>3.0.CO;2-6","volume":"33","author":"B. Beauquier","year":"1999","unstructured":"Beauquier, B.: All-to-all communication in some wavelength-routed all-optical networks. Networks\u00a033, 179\u2013187 (1999)","journal-title":"Networks"},{"key":"62_CR3","unstructured":"Beauquier, B., Bermond, J.C., Gargano, L., Hell, P., P\u00e8rennes, S., Vaccaro, U.: Graph problems arising from wavelength routing in all-optical networks. In: Proc. WOCS 1997, Geneve, Switzerland (1997)"},{"key":"62_CR4","unstructured":"Beauquier, B., P\u00e8rennes, S., Syska, M.: Efficient Access to Optical Bandwidth Routing and Grooming in WDM Networks: state-of-the-art survey, CRESCCO report IST-2001-33135, Universite de Nice-Sophia Antipolis, France (2002)"},{"key":"62_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/3-540-61440-0_160","volume-title":"Automata, Languages and Programming","author":"J.C. Bermond","year":"1996","unstructured":"Bermond, J.C., Gargano, L., Perennes, S., Rescigno, A.A., Vaccaro, U.: Efficient collective communication in optical networks. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 574\u2013585. Springer, Heidelberg (1996)"},{"key":"62_CR6","series-title":"Contemporary Mathematics series 352","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/conm\/352\/10","volume-title":"Graph Colorings","author":"J. Bia\u0142ogrodzki","year":"2004","unstructured":"Bia\u0142ogrodzki, J.: Path Coloring and Routing in Graphs. In: Kubale, M. (ed.) Graph Colorings. Contemporary Mathematics series 352, pp. 139\u2013152. AMS, Providence (2004)"},{"key":"62_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-27796-5_7","volume-title":"Structural Information and Communication Complexity","author":"S. Choplin","year":"2004","unstructured":"Choplin, S., Narayanan, L., Opatrny, J.: Two-Hop Virtual Path Layout in Tori. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 69\u201378. Springer, Heidelberg (2004)"},{"key":"62_CR8","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TIT.1987.1057290","volume":"33","author":"F.R.K. Chung","year":"1987","unstructured":"Chung, F.R.K., Coman, E.G., Reiman, M.I., Simon, B.E.: The forwarding index of communication networks. IEEE Trans. on Inf. Theory\u00a033, 224\u2013232 (1987)","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","volume":"255","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoret. Comp. Sci.\u00a0255, 33\u201350 (2001)","journal-title":"Theoret. Comp. Sci."},{"key":"62_CR10","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. 1st ACM-SIAM SODA, pp. 434\u2013443 (1990)"},{"key":"62_CR11","volume-title":"Fiber-optic networks","author":"P.E. Green","year":"1992","unstructured":"Green, P.E.: Fiber-optic networks. Prentice-Hall, New Jersey (1992)"},{"key":"62_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11424758_68","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"M. Ma\u0142afiejski","year":"2005","unstructured":"Ma\u0142afiejski, M., \u017byli\u0144ski, P.: Weakly cooperative guards in grids. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03480, pp. 647\u2013656. Springer, Heidelberg (2005)"},{"key":"62_CR13","doi-asserted-by":"crossref","unstructured":"Raghavan, R., Upfal, E.: Efficient routing in all-optical networks. In: Proc. 26th ACM STOC, pp. 134\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.4153\/CJM-1954-010-9","volume":"6","author":"W.T. Tutte","year":"1954","unstructured":"Tutte, W.T.: A contribution to the theory of chromatic polynomials. Canad. J. Math.\u00a06, 80\u201391 (1954)","journal-title":"Canad. J. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:01Z","timestamp":1619506981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11602613_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}