{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:22Z","timestamp":1725793822493},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_16","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"186-197","source":"Crossref","is-referenced-by-count":0,"title":["A $\\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations"],"prefix":"10.1007","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Csaba, B., Karpinski, M., Krysta, P.: Approximability of dense and sparse instances of minimum 2-connectivity, tsp and path problems. In: Eppstein, D. (ed.) SODA, ACM\/SIAM, pp. 74\u201383 (2002)"},{"key":"16_CR2","unstructured":"Alexander, A., Boyd, S., Elliott-Magwood, P.: On the integrality gap of the 2-edge connected subgraph problem. Technical Report TR-2006-04, SITE, University of Ottawa, Ottawa, Canada (2006)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., Svensson, O.: Approximating graphic tsp by matchings. In: Ostrovsky, R. (ed.) IEEE FOCS, pp. 560\u2013569 (2011)","DOI":"10.1109\/FOCS.2011.56"},{"key":"16_CR4","unstructured":"Seb\u0151, A., Vygen, J.: Shorter tours by nicer ears. CoRR abs\/1201.1870 (2012)"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM\u00a041(2), 214\u2013235 (1994)","journal-title":"J. ACM"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0895480199362071","volume":"14","author":"J. Cheriyan","year":"2001","unstructured":"Cheriyan, J., Seb\u0151, A., Szigeti, Z.: Improving on the 1.5 approximation of a smallest 2-edge connected spanning subgraph. SIAM J. Discrete Math.\u00a014, 170\u2013180 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44436-X_26","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"S. Vempala","year":"2000","unstructured":"Vempala, S., Vetta, A.: Factor 4\/3 approximations for minimum 2-connected subgraphs. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 262\u2013273. Springer, Heidelberg (2000)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-44693-1_38","volume-title":"STACS 2001","author":"P. Krysta","year":"2001","unstructured":"Krysta, P., Kumar, V.S.A.: Approximation algorithms for minimum size 2-connectivity problems. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 431\u2013442. Springer, Heidelberg (2001)"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.orl.2003.08.006","volume":"32","author":"W.T. Huh","year":"2004","unstructured":"Huh, W.T.: Finding 2-edge connected spanning subgraphs. Oper. Res. Lett.\u00a032(3), 212\u2013216 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1137\/110843514","volume":"27","author":"S. Boyd","year":"2013","unstructured":"Boyd, S., Iwata, S., Takazawa, K.: Finding 2-factors closer to tsp tours in cubic graphs. SIAM J. Discrete Math.\u00a027(2), 918\u2013939 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J.: Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In: Combinatorial Analysis, pp. 113\u2013127 (1960)","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"16_CR12","unstructured":"Schrijver, A.: Chapters 11-12. In: Combinatorial Optimization. Springer (2003)"},{"key":"16_CR13","unstructured":"Sun, Y.: Theoretical and experimental studies on the minimum size 2-edge-connected spanning subgraph problem. Master\u2019s thesis, University of Ottawa, Ottawa, Canada (2013)"},{"key":"16_CR14","first-page":"45","volume":"30","author":"B.D. McKay","year":"1981","unstructured":"McKay, B.D.: Practical graph isomorphism. Congressus Numerantium\u00a030, 45\u201387 (1981)","journal-title":"Congressus Numerantium"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:13:44Z","timestamp":1558905224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}