{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:30Z","timestamp":1725558990484},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_42","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"392-399","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring"],"prefix":"10.1007","author":[{"given":"Kang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Baker, B.S., Pinter, R.Y.: An algorithm for the optimal placement and routing of a circuit within a ring of pads. In: Proc. 24th Symp. Foundations of Computer Science, pp. 360\u2013370 (1983)","DOI":"10.1109\/SFCS.1983.6"},{"key":"42_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, 363\u2013378 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proc. of the 26th Annual ACM Symposium on the Theory of Computing, pp. 134\u2013143 (1994)","DOI":"10.1145\/195058.195119"},{"key":"42_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge Univ. Press, Cambridge (1995)"},{"issue":"5","key":"42_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 in a cycle. IEEE Trans. on Computers\u00a046(5), 600\u2013602 (1997)","journal-title":"IEEE Trans. on Computers"},{"key":"42_CR6","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."},{"issue":"1","key":"42_CR7","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 Journal on Discrete Mathematics\u00a011(1), 1\u201314 (1998)","journal-title":"Siam Journal on Discrete Mathematics"},{"key":"42_CR8","unstructured":"Wilfong, G., Winkler, P.: Ring routing and wavelength translation. In: Proc. of the ninth annual ACM-SIAM symposium on Discrete Algorithms (SODA 1998), San Francisco, California, pp. 333\u2013341 (1998)"},{"key":"42_CR9","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":"42_CR10","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)"},{"key":"42_CR11","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. J.ACM\u00a049, 157\u2013171 (2002)","journal-title":"J.ACM"},{"key":"42_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-24596-4_10","volume-title":"High Performance Computing - HiPC 2003","author":"Q.P. Gu","year":"2003","unstructured":"Gu, Q.P., Wang, Y.: Efficient algorithm for embedding hypergraph in a cycle. In: Pinkston, T.M., Prasanna, V.K. (eds.) HiPC 2003. LNCS (LNAI), vol.\u00a02913, pp. 85\u201394. Springer, Heidelberg (2003)"},{"key":"42_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-540-27836-8_38","volume-title":"Automata, Languages and Programming","author":"X. Deng","year":"2004","unstructured":"Deng, X., Li, G.: A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract). In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 433\u2013444. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:39:59Z","timestamp":1619505599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11496199_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}