{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T04:35:42Z","timestamp":1721622942612},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,3]],"date-time":"2014-08-03T00:00:00Z","timestamp":1407024000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0773-3","type":"journal-article","created":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T10:54:42Z","timestamp":1406976882000},"page":"427-436","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of the robust weighted independent set problems on interval graphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Adam","family":"Kasperski","sequence":"first","affiliation":[]},{"given":"Pawe\u0142","family":"Zieli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,3]]},"reference":[{"key":"773_CR1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.disopt.2010.03.004","volume":"7","author":"H Aissi","year":"2010","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: General approximation schemes for minmax (regret) versions of some (pseudo-)polynomial problems. Discrete Optim. 7, 136\u2013148 (2010)","journal-title":"Discrete Optim."},{"key":"773_CR2","unstructured":"Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D. (ed) Approximation Algorithms for NP-Hard Problems, chapter 10, pp. 1\u201354. PWS (1995)"},{"key":"773_CR3","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"773_CR4","unstructured":"Kasperski, A.: Discrete Optimization with Interval Data\u2014Minmax Regret and Fuzzy Approach, volume 228 of Studies in Fuzziness and Soft Computing. Springer, Berlin, Heidelberg (2008)"},{"key":"773_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A Kasperski","year":"2006","unstructured":"Kasperski, A., Zieli\u0144ski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97, 177\u2013180 (2006)","journal-title":"Inf. Process. Lett."},{"key":"773_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"773_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.tcs.2012.12.006","volume":"477","author":"M Mastrolilli","year":"2013","unstructured":"Mastrolilli, M., Mutsanas, N., Svensson, O.: Single machine scheduling with scenarios. Theor. Computer Sci. 477, 57\u201366 (2013)","journal-title":"Theor. Computer Sci."},{"key":"773_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1080\/00207169608804486","volume":"60","author":"M Pal","year":"1996","unstructured":"Pal, M., Bhattacharjee, G.: A sequential algorithm for finding a maximum weight k-independent set on interval graphs. Int. J. Computer Math. 60, 205\u2013214 (1996)","journal-title":"Int. J. Computer Math."},{"key":"773_CR9","doi-asserted-by":"crossref","first-page":"2480","DOI":"10.1016\/j.ins.2007.01.015","volume":"177","author":"A Saha","year":"2007","unstructured":"Saha, A., Pal, M., Pal, T.K.: Selection of programme slots of television channels for giving advertisement: A graph theoretic approach. Inf. Sci. 177, 2480\u20132492 (2007)","journal-title":"Inf. Sci."},{"key":"773_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s11590-012-0563-8","volume":"8","author":"F Talla Nobibon","year":"2014","unstructured":"Talla Nobibon, F., Leus, R.: Robust maximum weighted independent-set problems on interval graphs. Optim. Lett. 8, 227\u2013235 (2014)","journal-title":"Optim. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0773-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0773-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0773-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:15:37Z","timestamp":1553642137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0773-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["773"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0773-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,3]]}}}