{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:09:18Z","timestamp":1742940558106,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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-10801-4_7","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"67-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Reload Cost Graph Factors"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7869-0959","authenticated-orcid":false,"given":"Julien","family":"Baste","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8450-1897","authenticated-orcid":false,"given":"Didem","family":"G\u00f6z\u00fcpek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2688-5703","authenticated-orcid":false,"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0470-1800","authenticated-orcid":false,"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"18","key":"7_CR1","doi-asserted-by":"publisher","first-page":"3494","DOI":"10.1016\/j.dam.2008.02.013","volume":"156","author":"G Galbiati","year":"2008","unstructured":"Galbiati, G.: The complexity of a minimum reload cost diameter problem. Discrete Appl. Math. 156(18), 3494\u20133497 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1016\/j.comnet.2013.03.004","volume":"57","author":"S Arkoulis","year":"2013","unstructured":"Arkoulis, S., Anifantis, E., Karyotis, V., Papavassiliou, S., Mitrou, N.: On the optimal, fair and channel-aware cognitive radio network reconfiguration. Comput. Netw. 57(8), 1739\u20131757 (2013)","journal-title":"Comput. Netw."},{"issue":"7","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1109\/TMC.2012.101","volume":"12","author":"D G\u00f6z\u00fcpek","year":"2013","unstructured":"G\u00f6z\u00fcpek, D., Buhari, S., Alag\u00f6z, F.: A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks. IEEE Trans. Mob. Comput. 12(7), 1270\u20131280 (2013)","journal-title":"IEEE Trans. Mob. Comput."},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TCCN.2016.2608337","volume":"2","author":"A Celik","year":"2016","unstructured":"Celik, A., Kamal, A.E.: Green cooperative spectrum sensing and scheduling in heterogeneous cognitive radio networks. IEEE Trans. Cogn. Commun. Netw. 2(3), 238\u2013248 (2016)","journal-title":"IEEE Trans. Cogn. Commun. Netw."},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0166-218X(00)00392-9","volume":"113","author":"HC Wirth","year":"2001","unstructured":"Wirth, H.C., Steffan, J.: Reload cost problems: minimum diameter spanning tree. Discrete Appl. Math. 113(1), 73\u201385 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"13","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.dam.2010.03.009","volume":"158","author":"L Gourv\u00e8s","year":"2010","unstructured":"Gourv\u00e8s, L., Lyra, A., Martinhon, C., Monnot, J.: The minimum reload s-t path, trail and walk problems. Discrete Appl. Math. 158(13), 1404\u20131417 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1002\/net.20423","volume":"57","author":"E Amaldi","year":"2011","unstructured":"Amaldi, E., Galbiati, G., Maffioli, F.: On minimum reload cost paths, tours, and flows. Networks 57(3), 254\u2013260 (2011)","journal-title":"Networks"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-20662-7_10","volume-title":"Experimental Algorithms","author":"G Galbiati","year":"2011","unstructured":"Galbiati, G., Gualandi, S., Maffioli, F.: On minimum changeover cost arborescences. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 112\u2013123. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_10"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2014.03.023","volume":"540","author":"D G\u00f6z\u00fcpek","year":"2014","unstructured":"G\u00f6z\u00fcpek, D., Shalom, M., Voloshin, A., Zaks, S.: On the complexity of constructing minimum changeover cost arborescences. Theor. Comput. Sci. 540, 40\u201352 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2016.01.022","volume":"621","author":"D G\u00f6z\u00fcpek","year":"2016","unstructured":"G\u00f6z\u00fcpek, D., Shachnai, H., Shalom, M., Zaks, S.: Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621, 22\u201336 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2017.06.013","volume":"690","author":"D G\u00f6z\u00fcpek","year":"2017","unstructured":"G\u00f6z\u00fcpek, D., \u00d6zkan, S., Paul, C., Sau, I., Shalom, M.: Parameterized complexity of the mincca problem on graphs of bounded decomposability. Theor. Comput. Sci. 690, 91\u2013103 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR12","unstructured":"G\u00f6z\u00fcpek, D., Shalom, M.: Edge coloring with minimum reload\/changeover costs. arXiv preprint arXiv:1607.06751 (2016)"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/net.20443","volume":"59","author":"I Gamvros","year":"2012","unstructured":"Gamvros, I., Gouveia, L., Raghavan, S.: Reload cost trees and network design. Networks 59(4), 365\u2013379 (2012)","journal-title":"Networks"},{"issue":"12","key":"7_CR14","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.ipl.2009.02.013","volume":"109","author":"H Meijer","year":"2009","unstructured":"Meijer, H., N\u00fa\u00f1ez-Rodr\u00edguez, Y., Rappaport, D.: An algorithm for computing simple k-factors. Inf. Process. Lett. 109(12), 620\u2013625 (2009)","journal-title":"Inf. Process. Lett."},{"key":"7_CR15","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2003)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.dam.2011.12.006","volume":"164","author":"G Galbiati","year":"2014","unstructured":"Galbiati, G., Gualandi, S., Maffioli, F.: On minimum reload cost cycle cover. Discrete Appl. Math. 164, 112\u2013120 (2014)","journal-title":"Discrete Appl. Math."},{"key":"7_CR17","unstructured":"Baste, J., G\u00f6z\u00fcpek, D., Shalom, M., Thilikos, D.M.: Minimum reload cost graph factors. CoRR abs\/1810.11700 (2018). http:\/\/arxiv.org\/abs\/1810.11700"},{"key":"7_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"7_CR19","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. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"4","key":"7_CR20","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1016\/S0022-0000(03)00078-3","volume":"67","author":"K Pietrzak","year":"2003","unstructured":"Pietrzak, K.: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. J. Comput. Syst. Sci. 67(4), 757\u2013771 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 150\u2013159. IEEE Computer Society (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Pulleyblank, W.R.: Faces of matching polyhedra. Ph.D. thesis, University of Waterloo (1973)","DOI":"10.1007\/BFb0066196"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:15:57Z","timestamp":1709810157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","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":"92","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":"35","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":"6","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":"38% - 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":"3.3","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)"}}]}}