{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:12Z","timestamp":1725490452046},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73420-8_33","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T10:58:43Z","timestamp":1188039523000},"page":"363-374","source":"Crossref","is-referenced-by-count":15,"title":["Parameterized Approximability of the Disjoint Cycle Problem"],"prefix":"10.1007","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[]},{"given":"Magdalena","family":"Gr\u00fcber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jctb.1996.0062","volume":"68","author":"N. Alon","year":"1996","unstructured":"Alon, N.: Disjoint directed cycles. Journal of Combinatorial Theory Series B\u00a068(2), 167\u2013178 (1996)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"33_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3886-0","volume-title":"Digraphs","author":"J. Bang-Jensen","year":"2002","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs. Springer, Heidelberg (2002)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11847250_9","volume-title":"Parameterized and Exact Computation","author":"L. Cai","year":"2006","unstructured":"Cai, L., Huang, X.: Fixed-parameter approximation: Conceptual framework and approximability results. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 96\u2013108. Springer, Heidelberg (2006)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11847250_10","volume-title":"Parameterized and Exact Computation","author":"Y. Chen","year":"2006","unstructured":"Chen, Y., Grohe, M., Gr\u00fcber, M.: On parameterized approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 109\u2013120. Springer, Heidelberg (2006)"},{"key":"33_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/11847250_11","volume-title":"Parameterized and Exact Computation","author":"R.G. Downey","year":"2006","unstructured":"Downey, R.G., Fellows, M.R., McCartin, C.: Parameterized approximation algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 121\u2013129. Springer, Heidelberg (2006)"},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P. Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s, P., P\u00f3sa, L.: On the independent circuits contained in a graph. Canadian Journal of Mathematics\u00a017, 347\u2013352 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J.S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"33_CR9","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"33_CR10","first-page":"1331","volume-title":"Handbook of Combinatorics","year":"1995","unstructured":"Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.): Handbook of Combinatorics (volume\u00a0II, chapter Ramsey theory), pp. 1331\u20131403. Elsevier Science, Amsterdam (1995)"},{"key":"33_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"unstructured":"Guenin, B., Thomas, R.: Packing directed circuits exactly. To appear in Combinatorica (2006)","key":"33_CR12"},{"doi-asserted-by":"crossref","unstructured":"Gutin, G., Yeo, A.: Some parameterized problems on digraphs (Submitted 2006)","key":"33_CR13","DOI":"10.1093\/comjnl\/bxm039"},{"unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. To appear in The Computer Journal (2006)","key":"33_CR14"},{"key":"33_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"4","key":"33_CR16","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/BF01271272","volume":"16","author":"B. Reed","year":"1996","unstructured":"Reed, B., Robertson, N., Seymour, P., Thomas, R.: Packing directed circuits. Combinatorica\u00a016(4), 535\u2013554 (1996)","journal-title":"Combinatorica"},{"issue":"4","key":"33_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01271273","volume":"16","author":"B. Reed","year":"1996","unstructured":"Reed, B., Shepherd, F.: The gallai-younger conjecture for planar graphs. Combinatorica\u00a016(4), 555\u2013566 (1996)","journal-title":"Combinatorica"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/11496915_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"M. Salavatipour","year":"2005","unstructured":"Salavatipour, M., Verstraete, J.: Disjoint cycles: Integrality gap, hardness, and approximation. In: J\u00fcnger, M., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol.\u00a03509, pp. 51\u201365. Springer, Heidelberg (2005)"},{"issue":"2","key":"33_CR19","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P. Seymour","year":"1995","unstructured":"Seymour, P.: Packing directed circuits fractionally. Combinatorica\u00a015(2), 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/978-3-540-39658-1_44","volume-title":"Algorithms - ESA 2003","author":"A. Slivkins","year":"2003","unstructured":"Slivkins, A.: Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 482\u2013493. Springer, Heidelberg (2003)"},{"unstructured":"Younger, D.: Graphs with interlinked directed circuits. In: Proceedings of the Midwest Symposium on Circuit Theory 2, pages XVI 2.1\u2013XVI 2.7 (1973)","key":"33_CR21"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:26:34Z","timestamp":1558261594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734192","9783540734208"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}