{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:20:27Z","timestamp":1725571227671},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17461-2_13","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T04:53:59Z","timestamp":1292388839000},"page":"160-169","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs"],"prefix":"10.1007","author":[{"given":"Jing","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyu","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Agra, A., Cardoso, D., Cerfeira, O., Rocha, E.: A spanning star forest model for the diversity problem in automobile industry. In: Proc. of ECCO XVII (2005)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. Journal of Computer and System Sciences\u00a058(1), 193\u2013210 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-03816-7_9","volume-title":"Mathematical Foundations of Computer Science 2009","author":"S. Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kuropoulou, M.: An improved approximation bound for spanning star forest and color saving. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 90\u2013101. Springer, Heidelberg (2009)"},{"key":"13_CR4","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)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/j.tcs.2008.12.036","volume":"410","author":"J. Cardinal","year":"2009","unstructured":"Cardinal, J., Langerman, S., Levy, E.: Improved approximation bounds for edge dominating set in dense graphs. Theoretical Computer Science\u00a0410, 949\u2013957 (2009)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","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: Proc. of FOCS 2008, pp. 687\u2013696 (2008)","DOI":"10.1109\/FOCS.2008.47"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/978-3-540-74208-1_4","volume-title":"APPROX 2007","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.) APPROX 2007. LNCS, vol.\u00a04627, pp. 44\u201358. Springer, Heidelberg (2007)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Duh, R., Furer, M.: Approximation of k-set cover by semi local optimization. In: Proc. of STOC 1997, pp. 256\u2013264 (1997)","DOI":"10.1145\/258533.258599"},{"issue":"4","key":"13_CR9","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 lnn for aproximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Gaspers, S., Kratsch, D., Liedloff, M., Todinca, I.: Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms\u00a06(1), No. 9 (2009)","DOI":"10.1145\/1644015.1644024"},{"key":"13_CR11","unstructured":"Imamura, T., Iwama, K.: Approximating vertex cover on dense graphs. In: Proc. of SODA 2005, pp. 582\u2013589 (2005)"},{"issue":"3","key":"13_CR12","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 applications to genomic sequence alignment. SIAM Journal on Computing\u00a038(3), 946\u2013962 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proc. of STOC 1997, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.7151\/dmgt.1004","volume":"15","author":"I. Schiermeyer","year":"1995","unstructured":"Schiermeyer, I.: Problems remaining NP-complete for sparse or dense graphs. Discuss. Math. Graph. Theory\u00a015, 33\u201341 (1995)","journal-title":"Discuss. Math. Graph. Theory"},{"key":"13_CR15","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T22:55:12Z","timestamp":1559861712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}