{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:17:58Z","timestamp":1648509478454},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,11]],"date-time":"2008-09-11T00:00:00Z","timestamp":1221091200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s12351-008-0020-8","type":"journal-article","created":{"date-parts":[[2008,9,10]],"date-time":"2008-09-10T02:40:09Z","timestamp":1221014409000},"page":"235-256","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,11]]},"reference":[{"key":"20_CR1","unstructured":"Beigel R (1999) Finding maximum independent sets in sparse and general graphs. In: Proceedings of symposium on discrete algorithms, SODA\u201999, pp 856\u2013857"},{"key":"20_CR2","volume-title":"Graphs and hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge C (1973) Graphs and hypergraphs. North Holland, Amsterdam"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K","volume":"35","author":"J Chen","year":"2000","unstructured":"Chen J et al (2000) Improvement on vertex cover for low-degree graphs. Networks 35:253\u2013259","journal-title":"Networks"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J Chen","year":"2001","unstructured":"Chen J et al (2001) Vertex cover: further observations and further improvements. J Algorithms 41:280\u2013301","journal-title":"J Algorithms"},{"issue":"2","key":"20_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.orl.2006.02.004","volume":"35","author":"F Della Croce","year":"2007","unstructured":"Della Croce F et al (2007) Improved worst-case complexity for the min 3-set covering problem. Oper Res Lett 35(2):205\u2013210","journal-title":"Oper Res Lett"},{"key":"20_CR6","unstructured":"Eppstein D (2001) Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In: Proceedings of symposium on discrete algorithms, SODA\u201901, pp 329\u2013337"},{"issue":"5","key":"20_CR7","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1007\/s10958-006-0114-x","volume":"134","author":"SS Fedin","year":"2006","unstructured":"Fedin SS et al (2006) A2\u2016E\u2016\/4-time algorithm for max-cut. J Math Sci 134(5):2383\u20132391","journal-title":"J Math Sci"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Fomin F et al (2005) Measure and conquer: domination\u2014a case study. In: Proceedings of ICALP\u201905, vol 3580, Lecture Notes in Computer Science. Springer, Heidelberg, pp 191\u2013203","DOI":"10.1007\/11523468_16"},{"issue":"5","key":"20_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"FV Fomin","year":"2006","unstructured":"Fomin FV et al (2006) Pathwidth of cubic graphs and exact algorithms. Inform Process Lett 97(5):191\u2013196","journal-title":"Inform Process Lett"},{"key":"20_CR10","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR et al (1979) Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0166-218X(02)00402-X","volume":"130","author":"J Gramm","year":"2003","unstructured":"Gramm J et al (2003) Worst-case upper bounds for Max2Sat with an application to MaxCut. Discrete Appl Math 130:139\u2013155","journal-title":"Discrete Appl Math"},{"issue":"2","key":"20_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F Grandoni","year":"2006","unstructured":"Grandoni F (2006) A note on the complexity of minimum dominating set. J Discr Algorithms 4(2):209\u2013214","journal-title":"J Discr Algorithms"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Kneis J et al (2005) Algorithms based on the treewidth of graphs. In: Proceedings of international workshop on graph theoretical concepts in computer science, WG\u201905, vol. 3787, Lecture Notes in Computer Science. Springer, Heidelberg, pp 385\u2013396","DOI":"10.1007\/11604686_34"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"W\u0153ginger GJ (2003) Exact algorithms for NP-hard problems: a survey. In: Juenger M, Reinelt G, Rinaldi G (eds) Combinatorial Optimization\u2014Eureka! You shrink!, vol 2570, Lecture Notes in Computer Science. Springer, Heidelberg, pp 185\u2013207","DOI":"10.1007\/3-540-36478-1_17"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-008-0020-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-008-0020-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-008-0020-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T04:04:33Z","timestamp":1559448273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-008-0020-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,11]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s12351-008-0020-8","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,11]]}}}