{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:43:10Z","timestamp":1767138190192,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030105631","type":"print"},{"value":"9783030105648","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_19","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T07:40:07Z","timestamp":1545291607000},"page":"235-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weighted Upper Edge Cover: Complexity and Approximability"],"prefix":"10.1007","author":[{"given":"Kaveh","family":"Khoshkhah","sequence":"first","affiliation":[]},{"given":"Mehdi Khosravian","family":"Ghadikolaei","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Sikora","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-44543-4_18","volume-title":"Combinatorial Algorithms","author":"H AbouEisha","year":"2016","unstructured":"AbouEisha, H., Hussain, S., Lozin, V., Monnot, J., Ries, B., Zamaraev, V.: A boundary property for upper domination. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 229\u2013240. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_18"},{"issue":"1\u20132","key":"19_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"19_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., Kyropoulou, 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. 5734, pp. 90\u2013101. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_9"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.dam.2014.06.001","volume":"196","author":"N Boria","year":"2015","unstructured":"Boria, N., Croce, F.D., Paschos, V.T.: On the max min vertex cover problem. Discrete Appl. Math. 196, 62\u201371 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"4\u20135","key":"19_CR7","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.dam.2012.01.003","volume":"161","author":"N Bourgeois","year":"2013","unstructured":"Bourgeois, N., Croce, F.D., Escoffier, B., Paschos, V.T.: Fast algorithms for min independent dominating set. Discrete Appl. Math. 161(4\u20135), 558\u2013572 (2013)","journal-title":"Discrete Appl. Math."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.endm.2017.10.030","volume":"62","author":"A Boyaci","year":"2017","unstructured":"Boyaci, A., Monnot, J.: Weighted upper domination number. Electr. Notes Discrete Math. 62, 171\u2013176 (2017)","journal-title":"Electr. Notes Discrete Math."},{"issue":"6","key":"19_CR9","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":"1\u20133","key":"19_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.dam.2003.05.004","volume":"143","author":"GJ Chang","year":"2004","unstructured":"Chang, G.J.: The weighted independent domination problem is NP-complete for chordal graphs. Discrete Appl. Math. 143(1\u20133), 351\u2013352 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"19_CR11","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"},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/0608044","volume":"8","author":"DG Corneil","year":"1987","unstructured":"Corneil, D.G., Keil, J.M.: A dynamic programming approach to the dominating set problem on $$k$$-trees. SIAM J. Algebraic Discrete Methods 8(4), 535\u2013543 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"5","key":"19_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 36(5), 231\u2013236 (1990)","journal-title":"Inf. Process. Lett."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: nonblocker: parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 237\u2013245. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11611257_21"},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"4","author":"M Farber","year":"1982","unstructured":"Farber, M.: Independent domination in chordal graphs. Oper. Res. Lett. 4(1), 134\u2013138 (1982)","journal-title":"Oper. Res. Lett."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M Farber","year":"1984","unstructured":"Farber, M.: Domination, independent domination and duality in strongly chordal graphs. Discrete Appl. Math. 7, 115\u2013130 (1984)","journal-title":"Discrete Appl. Math."},{"key":"19_CR17","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)"},{"issue":"2","key":"19_CR18","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":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-71150-8_18","volume-title":"Combinatorial Optimization and Applications","author":"K Khoshkhah","year":"2017","unstructured":"Khoshkhah, K., Khosravian Ghadikolaei, M., Monnot, J., Theis, D.O.: Extended spanning star forest problems. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10627, pp. 195\u2013209. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71150-8_18"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2017.08.007","volume":"700","author":"VV Lozin","year":"2017","unstructured":"Lozin, V.V., Malyshev, D.S., Mosca, R., Zamaraev, V.: More results on weighted independent domination. Theor. Comput. Sci. 700, 63\u201374 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"19_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"DF Manlove","year":"1999","unstructured":"Manlove, D.F.: On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Appl. Math. 91(1\u20133), 155\u2013175 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"19_CR22","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."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, V.H.: The maximum weight spanning star forest problem on cactus graphs. Discrete Math. Alg. Appl. 7(2) (2015)","DOI":"10.1142\/S1793830915500184"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"197","DOI":"10.6028\/jres.082.019","volume":"82","author":"PJ Slater","year":"1977","unstructured":"Slater, P.J.: Enclaveless sets and mk-systems. J. Res. Nat. Bur. Stand. 82(3), 197\u2013202 (1977)","journal-title":"J. Res. Nat. Bur. Stand."},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","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."}],"updated-by":[{"DOI":"10.1007\/978-3-030-10564-8_33","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T00:00:00Z","timestamp":1554422400000}}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T09:51:14Z","timestamp":1709805074000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"5 April 2019","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Corollary 13 was found to be wrong and, therefore, it and everything pertaining to Corollary 13 was removed from the chapter.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}