{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:30Z","timestamp":1759638270481},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,21]],"date-time":"2011-12-21T00:00:00Z","timestamp":1324425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00453-011-9607-1","type":"journal-article","created":{"date-parts":[[2011,12,20]],"date-time":"2011-12-20T16:05:39Z","timestamp":1324397139000},"page":"498-516","source":"Crossref","is-referenced-by-count":9,"title":["Improved Approximation Algorithms for the Spanning Star Forest Problem"],"prefix":"10.1007","volume":"65","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roee","family":"Engelberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Thach Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prasad","family":"Raghavendra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atri","family":"Rudra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyanit","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,21]]},"reference":[{"key":"9607_CR1","volume-title":"ECCO XVIII","author":"A. Agra","year":"2005","unstructured":"Agra, A., Cardoso, D., Cerdeira, O., Rocha, E.: A\u00a0spanning star forest model for the diversity problem in automobile industry. In: ECCO XVIII, Minsk, May 2005"},{"key":"9607_CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley, New York (1992)"},{"key":"9607_CR3","first-page":"90","volume-title":"Mathematical Foundations of Computer Science","author":"S. Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kyropoulou, M.: An improved approximation bound for spanning star forest and color saving. In: Mathematical Foundations of Computer Science, pp.\u00a090\u2013101 (2009)"},{"key":"9607_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/11533719_14","volume-title":"International Computing and Combinatorics Conference","author":"V. Berry","year":"2005","unstructured":"Berry, V., Guillemot, S., Nicolas, F., Paul, C.: On the approximation of computing evolutionary trees. In: International Computing and Combinatorics Conference, pp.\u00a0115\u2013123 (2005)"},{"issue":"6","key":"9607_CR5","doi-asserted-by":"crossref","first-page":"2189","DOI":"10.1137\/080735503","volume":"39","author":"D. Chakrabarty","year":"2010","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. SIAM J. Comput. 39(6), 2189\u20132211 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9607_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Fiege","year":"1998","unstructured":"Fiege, U.: A\u00a0threshold of lnn for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"9607_CR7","unstructured":"Goemans, M.: Mathematical programming and approximation algorithms. Lecture at Udine School, Udine, Italy (1996)"},{"issue":"4","key":"9607_CR8","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. Goemans","year":"1994","unstructured":"Goemans, M., Williamson, D.: New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM J. Discrete Math. 7(4), 656\u2013666 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"9607_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2212\u03f5 . Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"issue":"4","key":"9607_CR10","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM 48(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"issue":"7","key":"9607_CR11","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/j.tcs.2009.10.002","volume":"412","author":"R. Krauthgamer","year":"2011","unstructured":"Krauthgamer, R., Mehta, A., Rudra, A.: Pricing commodities. Theor. Comput. Sci. 412(7), 602\u2013613 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9607_CR12","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994)","journal-title":"J. ACM"},{"key":"9607_CR13","first-page":"435","volume-title":"ACM Symposium on Theory of Computing","author":"P. Slav\u00edk","year":"1996","unstructured":"Slav\u00edk, P.: A\u00a0tight analysis of the greedy algorithm for set cover. In: ACM Symposium on Theory of Computing, pp.\u00a0435\u2013441 (1996)"},{"key":"9607_CR14","first-page":"567","volume-title":"ACM-SIAM Symposium on Discrete Algorithms","author":"A. Srinivasan","year":"2001","unstructured":"Srinivasan, A.: New approaches to covering and packing problems. In: ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0567\u2013576 (2001)"},{"key":"9607_CR15","unstructured":"Srinivasan, A.: Personal communication, August 2009"},{"issue":"3","key":"9607_CR16","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/070682150","volume":"38","author":"C. Thach Nguyen","year":"2008","unstructured":"Thach Nguyen, C., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM J. Comput. 38(3), 946\u2013962 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9607_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9607-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9607-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9607-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:09Z","timestamp":1559137509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9607-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,21]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9607"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9607-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,21]]}}}