{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T16:10:18Z","timestamp":1736007018773,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_22","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"199-209","source":"Crossref","is-referenced-by-count":0,"title":["Routing and Coloring for Maximal Number of Trees"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Tianping","family":"Shuai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits and nonapproximability\u2013towards tight results. SIAM J. Comput.\u00a027, 804\u2013915 (1998)","journal-title":"SIAM J. Comput."},{"key":"22_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.tcs.2003.12.019","volume":"314","author":"J. Gu","year":"2004","unstructured":"Gu, J., Hu, X.-D., Jia, X.-H., Zhang, M.-H.: Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science\u00a0314, 293\u2013301 (2004)","journal-title":"Theoretical Computer Science"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U.I. Gupta","year":"1982","unstructured":"Gupta, U.I., Lee, D.T., Leung, Y.-T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks\u00a012, 459\u2013467 (1982)","journal-title":"Networks"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc.\u00a010, 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00020","volume":"4","author":"M.M. Halld\u00f3rsson","year":"2000","unstructured":"Halld\u00f3rsson, M.M.: Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms and Applications\u00a04(1), 1\u201316 (2000)","journal-title":"J. Graph Algorithms and Applications"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. Hastad","year":"1999","unstructured":"Hastad, J.: Clique is hard to approximate within n1\u2212\u03b5. Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proc. 36th Annual ACM Symp. Theory of Computing, pp. 52\u201361 (1995)","DOI":"10.1109\/SFCS.1995.492462"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Kollipoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and packing integer programs. In: Integer Programming and Combinatorial Optimization, Houston, TX (1998)","DOI":"10.1007\/3-540-69346-7_12"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica\u00a015, 141\u2013145 (1981)","journal-title":"Acta Informatica"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in alloptical rings. In: IEEE INFOCOM 2003 (2003)","DOI":"10.1109\/INFCOM.2003.1208971"},{"key":"22_CR12","unstructured":"Nomikos, C., Zachos, S.: Coloring a maximum number of paths in graphs, Workshop on Algorithmic Aspects of Communication, Bologna (1997)"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","volume":"46","author":"P.J. Wan","year":"1998","unstructured":"Wan, P.J., Liu, L.: Maximal throughput in wavelength-routed optical networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a046, 15\u201326 (1998)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:37:52Z","timestamp":1736005072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11533719_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}