{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:45Z","timestamp":1767339585220},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_9","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"90-101","source":"Crossref","is-referenced-by-count":14,"title":["An Improved Approximation Bound for Spanning Star Forest and Color Saving"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Athanassopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Agra, A., Cardoso, D., Cerfeira, O., Rocha, E.: A spanning star forest model for the diversity problem in automobile industry. In: Proceedings of ECCO XVII (2005)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-74240-1_6","volume-title":"Fundamentals of Computation Theory","author":"S. Athanassopoulos","year":"2007","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 52\u201363. Springer, Heidelberg (2007)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences\u00a021, 136\u2013153 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(80)90006-7","volume":"12","author":"G. Ausiello","year":"1980","unstructured":"Ausiello, G., Marchetti-Spaccamela, A., Protasi, M.: Toward a unified approach for the classification of NP-complete optimation problems. Theoretical Computer Science\u00a012, 83\u201396 (1980)","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11533719_14","volume-title":"Computing and Combinatorics","author":"V. Berry","year":"2005","unstructured":"Berry, V., Guillemot, S., Nicholas, F., Paul, C.: On the approximation of computing evolutionary trees. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 115\u2013125. Springer, Heidelberg (2005)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/06067660X","volume":"23","author":"I. Caragiannis","year":"2009","unstructured":"Caragiannis, I.: Wavelength management in WDM rings to maximize the number of connections. SIAM Journal on Discrete Mathematics\u00a023(2), 959\u2013978 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 687\u2013696 (2008)","DOI":"10.1109\/FOCS.2008.47"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-74208-1_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N. Chen","year":"2007","unstructured":"Chen, N., Engelberg, R., Nguyen, C.T., Raghavendra, P., Rudra, A., Singh, G.: Improved approximation algorithms for the spanning star forest problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 44\u201358. Springer, Heidelberg (2007)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","volume":"158","author":"M. Demange","year":"1996","unstructured":"Demange, M., Paschos, V.T.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science\u00a0158, 117\u2013141 (1996)","journal-title":"Theoretical Computer Science"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(97)00099-6","volume":"209","author":"M. Demange","year":"1998","unstructured":"Demange, M., Grisoni, P., Paschos, V.T.: Differential approximation algorithms for some combinatorial optimization problems. Theoretical Computer Science\u00a0209, 107\u2013122 (1998)","journal-title":"Theoretical Computer Science"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Duh, R., F\u00fcrer, M.: Approximation of k-set cover by semi local optimization. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC 1997), pp. 256\u2013264 (1997)","DOI":"10.1145\/258533.258599"},{"key":"9_CR12","first-page":"251","volume":"12","author":"P. Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P., Sachs, H.: Regul\u00e4re Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Univ. Halle, Math.-Nat.\u00a012, 251\u2013258 (1963)","journal-title":"Wiss. Z. Univ. Halle, Math.-Nat."},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"9_CR14","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the 6th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 160\u2013169 (1995)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-61310-2_10","volume-title":"Integer Programming and Combinatorial Optimization","author":"M.M. Halld\u00f3rsson","year":"1996","unstructured":"Halld\u00f3rsson, M.M.: Approximating k-set cover and complementary graph coloring. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 118\u2013131. Springer, Heidelberg (1996)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jagm.2001.1187","volume":"41","author":"R. Hassin","year":"2001","unstructured":"Hassin, R., Khuller, S.: z-Approximations. Journal of Algorithms\u00a041(2), 429\u2013442 (2001)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics\u00a02(1), 68\u201372 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"6","key":"9_CR18","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/060655225","volume":"23","author":"A. Levin","year":"2009","unstructured":"Levin, A.: Approximating the unweighted k-set cover problem: greedy meets local search. SIAM Journal on Discrete Mathematics\u00a023(1), 251\u2013264 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/070682150","volume":"38","author":"C.T. Nguyen","year":"2008","unstructured":"Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM Journal on Computing\u00a038(3), 946\u2013962 (2008)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:33:49Z","timestamp":1558478029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}