{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:44Z","timestamp":1725558644991},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_12","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"137-149","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Ferrante","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mimmo","family":"Parente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jagm.1999.1006","volume":"32","author":"V. Auletta","year":"1999","unstructured":"Auletta, V., Dinitz, Y., Nutov, Z., Parente, M.: A 2 Approximation Algorithms for Finding an Optimum 3 Vertex Connected Spanning Subgraph. J. of Algorithms\u00a032, 21\u201330 (1999)","journal-title":"J. of Algorithms"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-36206-1_7","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"H.-J. B\u00f6ckenauer","year":"2002","unstructured":"B\u00f6ckenauer, H.-J., Bongartz, D., Hromkovi\u010d, J., Klasing, R., Proietti, G., Seibert, S., Unger, W.: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol.\u00a02556, pp. 59\u201370. Springer, Heidelberg (2002)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenauer, H.-J., Bongartz, D., Hromkovi\u010d, J., Klasing, R., Proietti, G., Seibert, S., Unger, W.: On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. To appear in Proc. of CIAC 2003. LNCS series (2003)","DOI":"10.1007\/3-540-44849-7_24"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"H.-J. B\u00f6ckenauer","year":"2000","unstructured":"B\u00f6ckenauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Approximation Algorithms for the TSP with Sharpened Triangle Inequality. Information Processing Letters\u00a075, 133\u2013138 (2000)","journal-title":"Information Processing Letters"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: An Improved Lower Bound on the Approximability Algorithms for the TSP with Sharpened Triangle Inequality. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 382\u2013394. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-46541-3_32"},{"key":"12_CR6","unstructured":"Czumaj, A., Lingas, A.: On Approximability of the minimum-cost k-connected spanning subgraph problem. In: Proc. of SODA 1999, pp. 281\u2013290 (1999)"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0931","volume":"28","author":"C.G. Fernandes","year":"1998","unstructured":"Fernandes, C.G.: A Better Approximation Ratio for the Minimum Size k-Edge- Connected Spanning Subgraph Problem. J. of Algorithms\u00a028(1), 105\u2013124 (1998)","journal-title":"J. of Algorithms"},{"key":"12_CR8","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)"},{"key":"12_CR9","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 approximation and graph carvings. Journal of the ACM\u00a041, 214\u2013235 (1994)","journal-title":"Journal of the ACM"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jagm.1995.0800","volume":"22","author":"M. Penn","year":"1997","unstructured":"Penn, M., Shasha-Krupnik, H.: Improved approximation Algorithms for weighted 2 and 3-vertex connectivity augmentation. J. of Algorithms\u00a022, 187\u2013196 (1997)","journal-title":"J. of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:18:40Z","timestamp":1552609120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}