{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:28Z","timestamp":1725574108825},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_25","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:28:22Z","timestamp":1294421302000},"page":"212-221","source":"Crossref","is-referenced-by-count":2,"title":["Finding k-Connected Subgraphs with Minimum Average Weight"],"prefix":"10.1007","author":[{"given":"Prabhakar","family":"Gubbala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1137\/S009753979833920X","volume":"30","author":"J. Cheriyan","year":"2000","unstructured":"Cheriyan, J., Thurimella, R.: Approximating minimum-size k-connected spanning subgraphs via Matching. SIAM J. Comput.\u00a030, 528\u2013560 (2000)","journal-title":"SIAM J. Comput."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimum-cost k-vertex connected subgraphs. In: STOC 2002, pp. 306\u2013312 (2002)","DOI":"10.1145\/509907.509955"},{"key":"25_CR3","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 for the minimum k-edge-connected spanning subgraph problem. J. Algorithms\u00a028, 105\u2013124 (1998)","journal-title":"J. Algorithms"},{"key":"25_CR4","first-page":"25","volume":"5","author":"G.N. Frederickson","year":"1982","unstructured":"Frederickson, G.N., J\u00e1J\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput.\u00a05, 25\u201353 (1982)","journal-title":"SIAM J. Comput."},{"key":"25_CR5","doi-asserted-by":"crossref","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. Assoc. Comput. Mach.\u00a041, 214\u2013235 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/BFb0055093","volume-title":"Automata, Languages and Programming","author":"A. Czumaj","year":"1998","unstructured":"Czumaj, A., Lingas, A.: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 682\u2013694. Springer, Heidelberg (1998)"},{"key":"25_CR7","unstructured":"Czumaj, A., Lingas, A.: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete. Algoithms (SODA), pp. 281\u2013290 (1999)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math.\u00a023, 309\u2013311 (1978)","journal-title":"Discrete Math."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"R.K. Ahuja","year":"1992","unstructured":"Ahuja, R.K., Orlin, J.B.: New scaling algorithms for assignment and minimum cycle mean problems. Mathematical Programming\u00a054, 41\u201356 (1992)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T07:49:13Z","timestamp":1553327353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}