{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:04:29Z","timestamp":1725674669386},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_7","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"73-84","source":"Crossref","is-referenced-by-count":1,"title":["Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Boria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/net.10091","volume":"42","author":"C. Archetti","year":"2003","unstructured":"Archetti, C., Bertazzi, L., Speranza, M.: Reoptimizing the traveling salesman problem. Networks\u00a042(3), 154\u2013159 (2003)","journal-title":"Networks"},{"issue":"17","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1016\/j.dam.2010.08.003","volume":"158","author":"C. Archetti","year":"2010","unstructured":"Archetti, C., Bertazzi, L., Speranza, M.: Reoptimizing the 0-1 knapsack problem. Discrete Applied Mathematics\u00a0158(17), 1879\u20131887 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR3","unstructured":"Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and approximation in reoptimization. In: CiE 2007: Logic and Computation and Logic in the Real World (2007)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11785293_20","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"G. Ausiello","year":"2006","unstructured":"Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of Minimum and Maximum Traveling Salesman\u2019s Tours. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 196\u2013207. Springer, Heidelberg (2006)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-69903-3_24","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"D. Bil\u00f2","year":"2008","unstructured":"Bil\u00f2, D., B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., M\u00f6mke, T., Widmayer, P., Zych, A.: Reoptimization of Steiner Trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 258\u2013269. Springer, Heidelberg (2008)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-93980-1_16","volume-title":"Approximation and Online Algorithms","author":"D. Bil\u00f2","year":"2009","unstructured":"Bil\u00f2, D., Widmayer, P., Zych, A.: Reoptimization of Weighted Graph and Covering Problems. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 201\u2013213. Springer, Heidelberg (2009)"},{"issue":"2","key":"7_CR7","first-page":"83","volume":"2","author":"H.J. B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.J., Forlizzi, L., Hromkovic, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: On the approximability of tsp on local modifications of optimally solved instances. Algorithmic Operations Research\u00a02(2), 83\u201393 (2007)","journal-title":"Algorithmic Operations Research"},{"issue":"36","key":"7_CR8","doi-asserted-by":"publisher","first-page":"3428","DOI":"10.1016\/j.tcs.2008.04.039","volume":"410","author":"H.J. B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.J., Hromkovic, J., Kr\u00e1lovic, R., M\u00f6mke, T., Rossmanith, P.: Reoptimization of steiner trees: Changing the terminal set. Theor. Comput. Sci.\u00a0410(36), 3428\u20133435 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-77566-9_5","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"H.-J. B\u00f6ckenhauer","year":"2008","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., M\u00f6mke, T., Widmayer, P.: On the Hardness of Reoptimization. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 50\u201365. Springer, Heidelberg (2008)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jda.2009.04.001","volume":"8","author":"H.J. B\u00f6ckenhauer","year":"2010","unstructured":"B\u00f6ckenhauer, H.J., Komm, D.: Reoptimization of the metric deadline TSP. J. Discrete Algorithms\u00a08(1), 87\u2013100 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R. Boppana","year":"1992","unstructured":"Boppana, R., Halld\u00f3rsson, M.: Approximating maximum independent sets by excluding subgraphs. BIT Numerical Mathematics\u00a032(2), 180\u2013196 (1992)","journal-title":"BIT Numerical Mathematics"},{"key":"7_CR12","unstructured":"Boria, N., Monnot, J., Paschos, V.T.: Reoptimization of maximum weight induced hereditary subgraph problems. Cahier du LAMSADE 311, LAMSADE, Universit\u00e9 Paris-Dauphine (June 2001)"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.jda.2009.07.002","volume":"8","author":"N. Boria","year":"2010","unstructured":"Boria, N., Paschos, V.: Fast reoptimization for the minimum spanning tree problem. Journal of Discrete Algorithms\u00a08(3), 296\u2013310 (2010)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"7_CR14","first-page":"86","volume":"4","author":"B. Escoffier","year":"2009","unstructured":"Escoffier, B., Milanic, M., Paschos, V.: Simple and fast reoptimizations for the steiner tree problem. Algorithmic Operations Research\u00a04(2), 86\u201394 (2009)","journal-title":"Algorithmic Operations Research"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U. Feige","year":"2004","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM Journal on Discrete Mathematics\u00a018, 219 (2004)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-56939-1_60","volume-title":"Automata, Languages and Programming","author":"C. Lund","year":"1993","unstructured":"Lund, C., Yannakakis, M.: The Approximation of Maximum Subgraph Problems. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 40\u201351. Springer, Heidelberg (1993)"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.: Graph minors. xx. wagner\u2019s conjecture. J. Comb. Theory, Ser. B\u00a092(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proc. STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:35:45Z","timestamp":1620128145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}