{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:28Z","timestamp":1759638748805,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711492"},{"type":"electronic","value":"9783319711508"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71150-8_18","type":"book-chapter","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:48:21Z","timestamp":1510793301000},"page":"195-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extended Spanning Star Forest Problems"],"prefix":"10.1007","author":[{"given":"Kaveh","family":"Khoshkhah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Khosravian Ghadikolaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk Oliver","family":"Theis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2012.05.028","volume":"223","author":"NAH Agatz","year":"2012","unstructured":"Agatz, N.A.H., Erera, A.L., Savelsbergh, M.W.P., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295\u2013303 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR2","unstructured":"Agra, A., Cardoso, D., Cerfeira, O., Rocha, E.: A spanning star forest model for the diversity problem in automobile industry. In: ECCO XVIII, Minsk (2005)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-03816-7_10","volume-title":"Mathematical Foundations of Computer Science 2009","author":"S Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Energy-efficient communication in multi-interface wireless networks. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 102\u2013111. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_10"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"H-J B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovic, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3), 133\u2013138 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"18_CR5","doi-asserted-by":"publisher","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":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00453-011-9607-1","volume":"65","author":"N Chen","year":"2013","unstructured":"Chen, N., Engelberg, R., Nguyen, C.T., Raghavendra, P., Rudra, A., Singh, G.: Improved approximation algorithms for the spanning star forest problem. Algorithmica 65(3), 498\u2013516 (2013)","journal-title":"Algorithmica"},{"key":"18_CR7","unstructured":"Delbot, F., Laforest, C., Phan, R.: Graphs with forbidden and required vertices. In: ALGOTEL 2015-17emes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications Jun 2015, Beaune (2015). https:\/\/hal.archives-ouvertes.fr\/hal-01148233"},{"key":"18_CR8","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-662-54110-4_16","volume-title":"Web and Internet Economics","author":"D Fotakis","year":"2016","unstructured":"Fotakis, D., Gourv\u00e8s, L., Monnot, J.: Conference program design with single-peaked and single-crossing preferences. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 221\u2013235. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_16"},{"key":"18_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Hartman, I.B.-A., Keren, D., Dbai, A.A., Cohen, E., Knapen, L., Yasar, A.-U.-H., Janssens, D.: Theory and practice in large carpooling problems. In: Shakshuki, E.M., Yasar, A.-U.-H. (eds.) Proceedings of the 5th International Conference on Ambient Systems, Networks and Technologies (ANT 2014), The 4th International Conference on Sustainable Energy Information Technology (SEIT-2014), Hasselt, 2\u20135 June 2014, vol. 32. Procedia Computer Science, pp. 339\u2013347. Elsevier (2014)","DOI":"10.1016\/j.procs.2014.05.433"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10878-012-9499-2","volume":"25","author":"J He","year":"2013","unstructured":"He, J., Liang, H.: Improved approximation for spanning star forest in dense graphs. J. Comb. Optim. 25(2), 255\u2013264 (2013)","journal-title":"J. Comb. Optim."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-58747-9_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"G Kutiel","year":"2017","unstructured":"Kutiel, G.: Approximation algorithms for the maximum carpool matching problem. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 206\u2013216. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58747-9_19"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/070682150","volume":"38","author":"CT 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 J. Comput. 38(3), 946\u2013962 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"1550018","DOI":"10.1142\/S1793830915500184","volume":"7","author":"VH Nguyen","year":"2015","unstructured":"Nguyen, V.H.: The maximum weight spanning star forest problem on cactus graphs. Discrete Math. Algorithms Appl. 7(2), 1550018 (2015)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"18_CR16","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"2","key":"18_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z Tuza","year":"1997","unstructured":"Tuza, Z.: Graph colorings with local constraints - a survey. Discussiones Mathematicae Graph Theory 17(2), 161\u2013228 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-319-48749-6_34","volume-title":"Combinatorial Optimization and Applications","author":"M Weller","year":"2016","unstructured":"Weller, M., Chateau, A., Giroudeau, R., K\u00f6nig, J.-C., Pollet, V.: On residual approximation in solution extension problems. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 463\u2013476. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48749-6_34"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71150-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:46:12Z","timestamp":1709819172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71150-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711492","9783319711508"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71150-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}