{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:35:59Z","timestamp":1648661759471},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,11,3]],"date-time":"2006-11-03T00:00:00Z","timestamp":1162512000000},"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":[[2006,12,28]]},"DOI":"10.1007\/s10878-006-9012-x","type":"journal-article","created":{"date-parts":[[2006,11,2]],"date-time":"2006-11-02T13:25:30Z","timestamp":1162473930000},"page":"103-122","source":"Crossref","is-referenced-by-count":0,"title":["On Ring Grooming in optical networks"],"prefix":"10.1007","volume":"13","author":[{"given":"Gruia","family":"C\u0103linescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng-Jun","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,3]]},"reference":[{"issue":"3","key":"9012_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal V (1979) A greedy heuristic for the set-covering problem. Math Oper Res 4(3):233\u2013235","journal-title":"Math Oper Res"},{"key":"9012_CR2","unstructured":"Coffman EG Jr, Garey MR, Johnson DS (1997) Approximation algorithms for bin-packing\u2014a survey. In: Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston, pp 46\u201393"},{"key":"9012_CR3","unstructured":"Dinits EA, Karzanov AV, Lomonosov ML (1976) On the structure of a family of minimal weighted cuts in a graph. In: Studies in discrete mathematics, pp 290\u2013306"},{"key":"9012_CR4","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. W.H. Freeman and Co"},{"key":"9012_CR5","unstructured":"Graham RL, Gr\u00f6tschel M, L\u00f3vasz L (1995) Handbook of combinatorics. MIT Press"},{"key":"9012_CR6","doi-asserted-by":"crossref","unstructured":"Kann V (1994) Maximum bounded H-matching is MAX SNP-complete. Inf Process Lett (49):309\u2013318","DOI":"10.1016\/0020-0190(94)90105-8"},{"key":"9012_CR7","unstructured":"Lovasz L (1979) Combinatorial problems and exercises North Holland"},{"key":"9012_CR8","unstructured":"Wan P-J, Liu L-W, (1999) Frieder O Grooming of arbitrary traffic in SONET\/WDM rings. IEEE GLOBECOM\u201999 1B:1012\u20131016"},{"key":"9012_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1117\/12.327061","volume":"3531","author":"X Zhang","year":"1998","unstructured":"Zhang X, Qiao C (1998) Effective and comprehensive solution to traffic grooming and wavelength assignment in SONET\/WDM rings. SPIE Proc. of All-Optical Networking: Architecture, Control, and Management Issues (Boston, MA) 3531:221\u2013232","journal-title":"SPIE Proc. of All-Optical Networking: Architecture, Control, and Management Issues (Boston, MA)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9012-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9012-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9012-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9012-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,3]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,12,28]]}},"alternative-id":["9012"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9012-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11,3]]}}}