{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:38:58Z","timestamp":1648827538681},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,25]],"date-time":"2011-01-25T00:00:00Z","timestamp":1295913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10878-011-9387-1","type":"journal-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T19:07:32Z","timestamp":1295896052000},"page":"319-328","source":"Crossref","is-referenced-by-count":1,"title":["A polynomial time approximation scheme for\u00a0embedding a directed hypergraph on a weighted ring"],"prefix":"10.1007","volume":"24","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,25]]},"reference":[{"key":"9387_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-3-540-27836-8_38","volume-title":"Proc 31st internat colloquium on automata, languages and programming (ICALP 2004)","author":"X Deng","year":"2004","unstructured":"Deng X, Li G (2004) A PTAS for embedding hypergraph in a cycle (extended abstract). In: Proc 31st internat colloquium on automata, languages and programming (ICALP 2004), Turku, Finland, 2004, pp 433\u2013444"},{"key":"9387_CR2","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/12.589233","volume":"46","author":"JL Ganley","year":"1997","unstructured":"Ganley JL, Cohoon JP (1997) Minimum-congestion hypergraph embedding in a cycle. IEEE Trans Comput 46:600\u2013602","journal-title":"IEEE Trans Comput"},{"key":"9387_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0190(98)00117-3","volume":"67","author":"T Gonzalez","year":"1998","unstructured":"Gonzalez T (1998) Improved approximation algorithm for embedding hyperedges in a cycle. Inf Process Lett 67:267\u2013271","journal-title":"Inf Process Lett"},{"key":"9387_CR4","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1137\/050631951","volume":"18","author":"H Ho","year":"2007","unstructured":"Ho H, Lee S (2007) Improved approximation algorithms for weighted hypergraph embedding in a cycle. SIAM J Optim 18:1490\u20131500","journal-title":"SIAM J Optim"},{"key":"9387_CR5","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"DS Hochbaum","year":"1988","unstructured":"Hochbaum DS, Shmoys D (1988) A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J Comput 17:539\u2013551","journal-title":"SIAM J Comput"},{"key":"9387_CR6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0020-0190(03)00297-7","volume":"87","author":"SL Lee","year":"2003","unstructured":"Lee SL, Ho H-J (2003) On minimizing the maximum congestion for weighted hypergraph embedding in a cycle. Inf Process Lett 87:271\u2013275","journal-title":"Inf Process Lett"},{"key":"9387_CR7","doi-asserted-by":"crossref","unstructured":"Li G, Deng X, Xu Y (2009) A polynomial time approximation scheme for embedding hypergraph in a cycle. ACM Trans Algorithms 5, Article No 20","DOI":"10.1145\/1497290.1497296"},{"key":"9387_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.ipl.2005.10.008","volume":"97","author":"K Li","year":"2006","unstructured":"Li K, Wang L (2006) A polynomial time approximation scheme for embedding a directed hypergraph on a ring. Inf Process Lett 97:203\u2013207","journal-title":"Inf Process Lett"},{"key":"9387_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M Li","year":"2002","unstructured":"Li M, Ma B, Wang L (2002) On the closest string and substring problems. J ACM 49:157\u2013171","journal-title":"J ACM"},{"key":"9387_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge Univ Press, Cambridge"},{"key":"9387_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s10878-007-9136-7","volume":"18","author":"QQ Nong","year":"2009","unstructured":"Nong QQ, Yuan JJ, Lin YX (2009) The weighted link ring loading problem. J Comb Optim 18:38\u201350","journal-title":"J Comb Optim"},{"key":"9387_CR12","doi-asserted-by":"crossref","first-page":"2978","DOI":"10.1016\/j.tcs.2010.04.035","volume":"411","author":"QQ Nong","year":"2010","unstructured":"Nong QQ, Cheng TCE, Ng CT (2010) A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. Theor Comput Sci 411:2978\u20132986","journal-title":"Theor Comput Sci"},{"key":"9387_CR13","first-page":"197","volume-title":"Lecture notes in computer science","author":"C Yang","year":"2010","unstructured":"Yang C, Li G (2010) A polynomial time approximation scheme for embedding hypergraph in a weighted cycle. In: Lecture notes in computer science, vol 6213, pp 197\u2013209"},{"key":"9387_CR14","first-page":"11","volume":"43","author":"Z Yang","year":"2008","unstructured":"Yang Z (2008) A 2-approximation algorithm for an embedded hypergraph in a weighted cycle. J Shandong Univ (Nat Sci) 43:11\u201313, in Chinese","journal-title":"J Shandong Univ (Nat Sci)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9387-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9387-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9387-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9387-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,25]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9387"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9387-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,25]]}}}