{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:37:16Z","timestamp":1725817036996},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_3","type":"book-chapter","created":{"date-parts":[[2015,2,22]],"date-time":"2015-02-22T23:05:18Z","timestamp":1424646318000},"page":"20-31","source":"Crossref","is-referenced-by-count":1,"title":["The Directed Ring Loading with Penalty Cost"],"prefix":"10.1007","author":[{"given":"Li","family":"Guan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuejie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0304-3975(01)00255-9","volume":"287","author":"L. Becchetti","year":"2002","unstructured":"Becchetti, L., Ianni, M.D., Spaccamela, A.M.: Approximation algorithms for routing and call scheduling in all-optical chains and rings. Theoretical Computer Science\u00a0287(2), 429\u2013448 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0166-218X(92)90007-W","volume":"40","author":"A. Frank","year":"1992","unstructured":"Frank, A., Nishizeki, T., Saito, N., Suzuki, H., Tardos, E.: Algorithms for routing around a rectangle. Discrete Applied Mathematics\u00a040(3), 363\u2013378 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/12.589233","volume":"46","author":"J.L. Ganley","year":"1997","unstructured":"Ganley, J.L., Cohoon, J.P.: Minimum-congestion hypergraph embedding in a cycle. IEEE Transactions on Computers\u00a046(5), 600\u2013602 (1997)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR4","volume-title":"Computer and Intractability: A Guide to The Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to The Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0020-0190(98)00117-3","volume":"67","author":"T. Gonzalez","year":"1998","unstructured":"Gonzalez, T.: Improved approximation algorithm for embedding hyperedges in a cycle. Information Processing Letters\u00a067(5), 267\u2013271 (1998)","journal-title":"Information Processing Letters"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TPDS.2006.34","volume":"17","author":"Q. Gu","year":"2006","unstructured":"Gu, Q., Wang, Y.: Efficient algorithms for minimum congestion hypergraph embedding in a cycle. IEEE Transactions on Parallel and Distributed Systems\u00a017(3), 205\u2013214 (2006)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1137\/050631951","volume":"18","author":"H. Ho","year":"2008","unstructured":"Ho, H., Lee, S.: Improved approximation algorithms for weighted hypergraph embedding in a cycle. SIAM Journal on Optimization\u00a018(4), 1490\u20131500 (2008)","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"3_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0020-0190(03)00297-7","volume":"87","author":"S. Lee","year":"2003","unstructured":"Lee, S., Ho, H.: On minimizing the maximum congestion for weighted hypergraph embedding in a cycle. Information Processing Letters\u00a087(5), 271\u2013275 (2003)","journal-title":"Information Processing Letters"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Li, G., Deng, X., Xu, Y.: A polynomial time approximation scheme for embedding hypergraph in a cycle. ACM Transactions on Algorithms 5(2), Article No 20 (2009)","DOI":"10.1145\/1497290.1497296"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10878-011-9387-1","volume":"24","author":"J. Li","year":"2012","unstructured":"Li, J., Li, W., Wang, L.: A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. Journal of Combinatorial Optimization\u00a024(3), 319\u2013328 (2012)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"3_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2005.10.008","volume":"97","author":"K. Li","year":"2006","unstructured":"Li, K., Wang, L.: A polynomial time approximation scheme for embedding a directed hypergraph on a ring. Information Processing Letters\u00a097(5), 203\u2013207 (2006)","journal-title":"Information Processing Letters"},{"issue":"1-2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ipl.2013.08.004","volume":"114","author":"W. Li","year":"2014","unstructured":"Li, W., Li, J., Guan, L.: Approximation algorithms for the ring loading problem with penalty cost. Information Processing Letters\u00a0114(1-2), 56\u201359 (2014)","journal-title":"Information Processing Letters"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/S0036144599356470","volume":"41","author":"A. Schrijver","year":"1999","unstructured":"Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM Review\u00a041, 777\u2013791 (1999)","journal-title":"SIAM Review"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Wang, Q., Liu, X., Zheng, X., Zhao, X.: A 2-approximation algorithm for weighted directed hypergraph embedding in a cycle. In: The 4th International Conference on Natural Computation, pp. 377\u2013381 (2008)","DOI":"10.1109\/ICNC.2008.241"},{"key":"3_CR15","unstructured":"Wilfong, G., Winkler, P.: Ring routing and wavelength translation. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 333\u2013341 (1998)"},{"issue":"48","key":"3_CR16","doi-asserted-by":"publisher","first-page":"6786","DOI":"10.1016\/j.tcs.2011.08.014","volume":"412","author":"C. Yang","year":"2011","unstructured":"Yang, C., Li, G.: A polynomial time approximation scheme for embedding hypergraph in a weighted cycle. Theoretical Computer Science\u00a0412(48), 6786\u20136793 (2011)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:13:45Z","timestamp":1559110425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}