{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:21Z","timestamp":1725488601680},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424871"},{"type":"electronic","value":"9783540446699"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44669-9_55","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:32:26Z","timestamp":1186741946000},"page":"483-494","source":"Crossref","is-referenced-by-count":5,"title":["New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danica","family":"Vukadinovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"issue":"6","key":"55_CR1","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1145\/235809.235812","volume":"46","author":"A. Aggarwal","year":"1996","unstructured":"A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing in optical networks. Journal of the ACM, 46(6):973\u20131001, November 1996.","journal-title":"Journal of the ACM"},{"key":"55_CR2","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993."},{"key":"55_CR3","unstructured":"B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from wavelength-routing in all-optical networks. In Proceedings of IPPS\u201997, Second Workshop on Optics and Computer Science (WOCS), 1997."},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M. C. Carlisle","year":"1995","unstructured":"M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Appl. Math., 59:225\u2013235, 1995.","journal-title":"Discrete Appl. Math."},{"key":"55_CR5","volume-title":"Technical Report CMU-CS-95-201","author":"A. Feldmann","year":"1995","unstructured":"A. Feldmann. On-line call admission for high-speed networks (Ph.D. Thesis). Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1995."},{"key":"55_CR6","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"55_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/3-540-63165-8_206","volume-title":"Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP\u201997","author":"L. Gargano","year":"1997","unstructured":"L. Gargano, P. Hell, and S. Perennes. Colouring paths in directed symmetric trees with applications to WDM routing. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP\u201997, LNCS 1256, pages 505\u2013515, 1997."},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"L. Gargano and U. Vaccaro. Routing in all-optical networks: Algorithmic and graph-theoretic problems. In I. Alth\u00f6fer et al., editors, Numbers, Information and Complexity, pages 555\u2013578. Kluwer Academic Publishers, 2000.","DOI":"10.1007\/978-1-4757-6048-4_45"},{"key":"55_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988."},{"key":"55_CR10","doi-asserted-by":"crossref","unstructured":"V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing STOC\u201999, pages 19\u201328, 1999.","DOI":"10.1145\/301250.301262"},{"key":"55_CR11","unstructured":"R. Klasing. Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Department of Computer Science, University of Warwick, September 1998. Presented as invited talk at the MFCS\u201998 Workshop on Communications."},{"key":"55_CR12","unstructured":"J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, 1996."},{"key":"55_CR13","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C. E. Shannon","year":"1949","unstructured":"C. E. Shannon. A theorem on coloring lines of a network. J. Math. Phys., 28:148\u2013151, 1949.","journal-title":"J. Math. Phys."},{"key":"55_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data structures and network algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan. Data structures and network algorithms. SIAM, Philadelphia, PA, 1983."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44669-9_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:28:46Z","timestamp":1550741326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44669-9_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424871","9783540446699"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44669-9_55","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}