{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:43Z","timestamp":1725567043144},"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_24","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"220-229","source":"Crossref","is-referenced-by-count":0,"title":["On Packing and Coloring Hyperedges in a Cycle"],"prefix":"10.1007","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken C. K.","family":"Law","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/12.736445","volume":"47","author":"T. Carpenter","year":"1998","unstructured":"Carpenter, T., Cosares, S., Ganley, J.L., Saniee, I.: A simple approximation algorithm for two problems in circuit design. IEEE Trans. Compt.\u00a047(11), 1310\u20131312 (1998)","journal-title":"IEEE Trans. Compt."},{"key":"24_CR3","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.T. Deng","year":"2004","unstructured":"Deng, X.T., Li, G.J.: A PTAS for embeding 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)"},{"issue":"5","key":"24_CR4","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. Comput.\u00a046(5), 600\u2013602 (1997)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR5","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, San Francisco (1979)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0020-0190(98)00117-3","volume":"67","author":"T.F. Gonzalez","year":"1998","unstructured":"Gonzalez, T.F.: Improved approximation algorithms for embedding hyperedges in a cycle. Information Processing Letter\u00a067, 267\u2013271 (1998)","journal-title":"Information Processing Letter"},{"doi-asserted-by":"crossref","unstructured":"Gu, Q., Wang, Y.: Efficient algorithm for embedding hypergraphs in a cycle. In: Proceedings of the 10th International Conference on High Performance Computing, Hyderabad, India (December 2003)","key":"24_CR7","DOI":"10.1007\/978-3-540-24596-4_10"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0020-0190(03)00297-7","volume":"87","author":"S.L. Lee","year":"2003","unstructured":"Lee, S.L., Ho, H.J.: On minimizing the maximum congestion for weighted hypergraph embedding in a cycle. Information Processing Letter\u00a087, 271\u2013275 (2003)","journal-title":"Information Processing Letter"},{"doi-asserted-by":"crossref","unstructured":"Li, J.P., Li, K., Wang, L.S., Zhao, H.: Maximizing Profits of Requests in WDM Networks, to appear in Journal of Combinatorial Optimization (2005)","key":"24_CR9","DOI":"10.1007\/s10878-005-2263-0"},{"doi-asserted-by":"crossref","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing Request Blocking in All- Optical Rings. In: Proceedings of IEEE INFOCOM, pp. 1355\u20131361 (2003)","key":"24_CR10","DOI":"10.1109\/INFCOM.2003.1208971"},{"doi-asserted-by":"crossref","unstructured":"Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceeding of the 26th Annual ACM Symposium on the Theory of Computing, pp. 134\u2013143 (1994)","key":"24_CR11","DOI":"10.1145\/195058.195119"},{"key":"24_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, The Netherlands (2003)"},{"key":"24_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. Tarjan","year":"1983","unstructured":"Tarjan, R.: Data Structures and Network Algorithms. SIAM, Philadelphia (1983)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:36:22Z","timestamp":1586471782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11533719_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}