{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:35Z","timestamp":1725605555619},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_66","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:01:16Z","timestamp":1315465276000},"page":"589-602","source":"Crossref","is-referenced-by-count":6,"title":["A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Carrabs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Cerulli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monica","family":"Gentili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gennaro","family":"Parlato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"66_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discrete Math.\u00a012(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"66_CR2","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R. Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput.\u00a027(4), 942\u2013959 (1998)","journal-title":"SIAM J. Comput."},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Becker, A., Geiger, D.: Approximation Algorithms for the Loop Cutset Problem. In: Proceedings of the 10th Conference on Uncertainty in Articial Intelligence, pp. 60\u201368 (1994)","DOI":"10.1016\/B978-1-55860-332-5.50013-4"},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(99)00180-8","volume":"101","author":"L. Brunetta","year":"2000","unstructured":"Brunetta, L., Maffioli, F., Trubian, M.: Solving The Feedback Vertex Set Problem On Undirected Graphs. Discrete Applied Mathematics\u00a0101, 37\u201351 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"66_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ipl.2004.12.008","volume":"94","author":"F. Carrabs","year":"2005","unstructured":"Carrabs, F., Cerulli, R., Gentili, M., Parlato, G.: A Linear Time Algorithm for the Minimum Weighted Feedback Vertex Set on Diamonds. Information Processing Letters\u00a094, 29\u201335 (2005)","journal-title":"Information Processing Letters"},{"key":"66_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s002360050088","volume":"34","author":"M.S. Chang","year":"1997","unstructured":"Chang, M.S., Liang, Y.D.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Informatica\u00a034, 337\u2013346 (1997)","journal-title":"Acta Informatica"},{"key":"66_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"2","key":"66_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/S0895480195291874","volume":"13","author":"G. Even","year":"2000","unstructured":"Even, G., Naor, J., Schieber, B., Zosin, L.: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discrete Math.\u00a013(2), 255\u2013267 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"66_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11847250_17","volume-title":"Parameterized and Exact Computation","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a minimum feedback vertex set in time $\\mathcal{O} (1.7548^n)$ . In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 184\u2013191. Springer, Heidelberg (2006)"},{"key":"66_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu Search. ORSA Journal on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"key":"66_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)"},{"key":"66_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu Search: A Tutorial. Interfaces\u00a020, 74\u201394 (1990)","journal-title":"Interfaces"},{"key":"66_CR13","unstructured":"Kleinberg, J., Kumar, A.: Wavelength Conversion in Optical Networks. Journal of Algorithms, 566\u2013575 (1999)"},{"key":"66_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","volume":"52","author":"Y.D. Liang","year":"1994","unstructured":"Liang, Y.D.: On the feedback vertex set problem in permutation graphs. Information Processing Letters\u00a052, 123\u2013129 (1994)","journal-title":"Information Processing Letters"},{"key":"66_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(96)00193-7","volume":"61","author":"C.L. Lu","year":"1997","unstructured":"Lu, C.L., Tang, C.Y.: A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs. Information Processing Letters\u00a061, 107\u2013111 (1997)","journal-title":"Information Processing Letters"},{"issue":"3","key":"66_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.5755\/j01.itc.35.3.11770","volume":"35","author":"A. Misevicius","year":"2006","unstructured":"Misevicius, A., Lenkevicius, A., Rubliauskas, D.: Iterated tabu search: an improvement to standard tabu search. Information Technology and Control\u00a035(3), 187\u2013197 (2006)","journal-title":"Information Technology and Control"},{"key":"66_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11785293_17","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"I. Razgon","year":"2006","unstructured":"Razgon, I.: Exact computation of maximum induced forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"key":"66_CR18","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T17:27:40Z","timestamp":1638552460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}