{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:13Z","timestamp":1725572173244},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_22","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"310-321","source":"Crossref","is-referenced-by-count":3,"title":["Packing Directed Cycles Efficiently"],"prefix":"10.1007","author":[{"given":"Zeev","family":"Nutov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jagm.1994.1005","volume":"16","author":"N. Alon","year":"1994","unstructured":"Alon, N., Duke, R.A., Lefmann, H., R\u00f6dl, V., Yuster, R.: The algorithmic aspects of the Regularity Lemma. Journal of Algorithms\u00a016, 80\u2013109 (1994)","journal-title":"Journal of Algorithms"},{"key":"22_CR2","first-page":"700","volume-title":"Proc. 35th ACM STOC","author":"N. Alon","year":"2003","unstructured":"Alon, N., Shapira, A.: Testing subgraphs in directed graphs. In: Proc. 35th ACM STOC, pp. 700\u2013709. ACM Press, New York (2003)"},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0963548302005461","volume":"12","author":"P. Balister","year":"2003","unstructured":"Balister, P.: Packing digraphs with directed closed trails. Combin. Probab. Comput.\u00a012, 1\u201315 (2003)","journal-title":"Combin. Probab. Comput."},{"key":"22_CR5","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. Academic Press, London (1978)"},{"key":"22_CR6","first-page":"252","volume-title":"Proc. 20th ACM STOC","author":"D. Dor","year":"1992","unstructured":"Dor, D., Tarsi, M.: Graph decomposition is NPC - A complete proof of Holyer\u2019s conjecture. In: Proc. 20th ACM STOC, pp. 252\u2013263. ACM Press, New York (1992)"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0195-6698(85)80045-7","volume":"6","author":"P. Frankl","year":"1985","unstructured":"Frankl, P., R\u00f6dl, V.: Near perfect coverings in graphs and hypergraphs. European J. Combinatorics\u00a06, 317\u2013326 (1985)","journal-title":"European J. Combinatorics"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z. F\u00fcredi","year":"1988","unstructured":"F\u00fcredi, Z.: Matchings and covers in hypergraphs. Graphs and Combinatorics\u00a04, 115\u2013206 (1988)","journal-title":"Graphs and Combinatorics"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0020-0190(96)00181-0","volume":"60","author":"D. Grable","year":"1996","unstructured":"Grable, D.: Nearly-perfect hypergraph packing is in NC. Information Processing Letters\u00a060, 295\u2013299 (1996)","journal-title":"Information Processing Letters"},{"key":"22_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s004930170003","volume":"21","author":"P.E. Haxell","year":"2001","unstructured":"Haxell, P.E., R\u00f6dl, V.: Integer and fractional packings in dense graphs. Combinatorica\u00a021, 13\u201338 (2001)","journal-title":"Combinatorica"},{"key":"22_CR12","unstructured":"Krivelevich, M., Nutov, Z., Yuster, R.: Approximation algorithms for cycle packing problems (preprint)"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0166-218X(94)00060-Q","volume":"60","author":"Z. Nutov","year":"1995","unstructured":"Nutov, Z., Penn, M.: On the integral dicycle packings and covers and the linear ordering polytope. Discrete Applied Math.\u00a060, 293\u2013309 (1995)","journal-title":"Discrete Applied Math."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P.D. Seymour","year":"1995","unstructured":"Seymour, P.D.: Packing directed circuits fractionally. Combinatorica\u00a015, 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"22_CR15","unstructured":"Szemer\u00e9di, E.: Regular partitions of graphs. In: Proc. Colloque Inter. CNRS 260, CNRS, Paris, pp. 399\u2013401 (1978)"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"Tardos, \u00c9.: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research\u00a034, 250\u2013256 (1986)","journal-title":"Operations Research"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Yuster, R.: Integer and fractional packing of families of graphs, Random Structures and Algorithms (to appear)","DOI":"10.1002\/rsa.20048"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:54Z","timestamp":1620012474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}