{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:11Z","timestamp":1794381071934,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_38","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"433-444","source":"Crossref","is-referenced-by-count":9,"title":["A PTAS for Embedding Hypergraph in a Cycle"],"prefix":"10.1007","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"38_CR1","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539701397825","volume":"32","author":"X. Deng","year":"2003","unstructured":"Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic Design of Drugs Without Side-Effects. SIAM J. Comput.\u00a032(4), 1073\u20131090 (2003)","journal-title":"SIAM J. Comput."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/A:1019545003953","volume":"6","author":"X. Deng","year":"2002","unstructured":"Deng, X., Li, G., Wang, L.: Center and Distinguisher for Strings with Unbounded Alphabet. Journal of Combinatorial Optimization\u00a06, 383\u2013400 (2002)","journal-title":"Journal of Combinatorial Optimization"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","volume":"38","author":"A. Frank","year":"1985","unstructured":"Frank, A.: Edge-disjoint paths in planar graphs. J. Combin. Theory Ser. B\u00a038, 164\u2013178 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"38_CR4","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, 363\u2013378 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"38_CR5","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 on a cycle. IEEE Trans. on Computers\u00a046(5), 600\u2013602 (1997)","journal-title":"IEEE Trans. on Computers"},{"key":"38_CR6","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, 267\u2013271 (1998)","journal-title":"Information Processing Letters"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Gu, Q.P., Wang, Y.: Efficient algorithm for embedding hypergraph in a cycle. In: Proceedings of the 10th International Conference On High Performance Computing, Hyderabad, India, December 2003, pp. 85\u201394 (2003)","DOI":"10.1007\/978-3-540-24596-4_10"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/bltj.2047","volume":"2","author":"S. Khanna","year":"1997","unstructured":"Khanna, S.: A Polynomial Time Approximation Scheme for the SONET Ring Loading Problem. Bell Labs Tech. J.\u00a02, 36\u201341 (1997)","journal-title":"Bell Labs Tech. J."},{"key":"38_CR9","unstructured":"Lee, S.L., Ho, H.J.: Algorithms and complexity for weighted hypergraph embedding in a cycle. In: Proc. of the 1st International Symposium on Cyber World, CW 2002 (2002)"},{"issue":"2","key":"38_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. JACM\u00a049(2), 157\u2013171 (2002)","journal-title":"JACM"},{"key":"38_CR11","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. mbridge Univ. Press, Cambridge"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity Flows in Planar Graph. Journal of Combinatorial Theory, Series B\u00a031, 75\u201381 (1981)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"38_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A., Seymour, P., Winkler, P.: The Ring Loading Problem. SIAM Discrete Mathematics\u00a011(1), 1\u201314 (1998)","journal-title":"SIAM Discrete Mathematics"},{"issue":"4","key":"38_CR14","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(4), 777\u2013791 (1999)","journal-title":"SIAM Review"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:30:57Z","timestamp":1619998257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_38","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}