{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:23:40Z","timestamp":1787509420750,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030174019","type":"print"},{"value":"9783030174026","type":"electronic"}],"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-17402-6_6","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:37:00Z","timestamp":1558345020000},"page":"62-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"van Bevern","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oxana Yu.","family":"Tsidulko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Zschoche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ejor.2014.10.011","volume":"242","author":"K Aardal","year":"2015","unstructured":"Aardal, K., van den Berg, P.L., Gijswijt, D., Li, S.: Approximation algorithms for hard capacitated $$k$$-facility location problems. Eur. J. Oper. Res. 242(2), 358\u2013368 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00103-1","volume":"93","author":"AA Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.I.: An 0.828-approximation algorithm for the uncapacitated facility location problem. Discr. Appl. Math. 93(2), 149\u2013156 (1999)","journal-title":"Discr. Appl. Math."},{"issue":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1051\/ita\/2016022","volume":"50","author":"\u00c9 Bonnet","year":"2016","unstructured":"Bonnet, \u00c9., Paschos, V.T., Sikora, F.: Parameterized exact and approximation algorithms for maximum $$k$$-set cover and related satisfiability problems. RAIRO-Inf. Theor. Appl. 50(3), 227\u2013240 (2016)","journal-title":"RAIRO-Inf. Theor. Appl."},{"issue":"6","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"6_CR6","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, Heidelberg (2015)"},{"issue":"11","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.dam.2011.03.021","volume":"159","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Fernau, H.: Facility location problems: a parameterized view. Discr. Appl. Math. 159(11), 1118\u20131130 (2011)","journal-title":"Discr. Appl. Math."},{"key":"6_CR8","unstructured":"Filmus, Y., Ward, J.: The power of local search: maximum coverage over a matroid. In: Proceedings of 29th STACS, LIPIcs, vol. 14, pp. 601\u2013612. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2012)"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/2886094","volume":"63","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 29:1\u201329:60 (2016)","journal-title":"J. ACM"},{"issue":"3","key":"6_CR10","first-page":"36:1","volume":"13","author":"FV Fomin","year":"2017","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Representative families of product families. ACM T. Algorithms 13(3), 36:1\u201336:29 (2017)","journal-title":"ACM T. Algorithms"},{"key":"6_CR11","unstructured":"Golovach, P.A., Heggernes, P., Konstantinidis, A.L., Lima, P.T., Papadopoulos, C.: Parameterized aspects of strong subgraph closure. In: Proceedings of 16th SWAT, LIPIcs, vol. 101, pp. 23:1\u201323:13. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2018)"},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter, M.S.: The strength of weak ties. Am. J. Sociol. 78(6), 1360\u20131380 (1973)","journal-title":"Am. J. Sociol."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1287\/moor.2014.0678","volume":"40","author":"R Krishnaswamy","year":"2015","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: Facility location with matroid or knapsack constraints. Math. Oper. Res. 40(2), 446\u2013459 (2015)","journal-title":"Math. Oper. Res."},{"key":"6_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13111-5","volume-title":"Location Science","year":"2015","unstructured":"Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.): Location Science. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-13111-5"},{"key":"6_CR15","volume-title":"Combinatorial Optimization-Networks and Matroids","author":"E Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization-Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/11083232X","volume":"42","author":"J Lee","year":"2013","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Matroid matching: the power of local search. SIAM J. Comput. 42(1), 357\u2013379 (2013)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR17","first-page":"14:1","volume":"14","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Misra, P., Panolan, F., Saurabh, S.: Deterministic truncation of linear matroids. ACM Trans. Algorithms 14(2), 14:1\u201314:20 (2018)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"issue":"44","key":"6_CR19","doi-asserted-by":"publisher","first-page":"4471","DOI":"10.1016\/j.tcs.2009.07.027","volume":"410","author":"D Marx","year":"2009","unstructured":"Marx, D.: A parameterized view on matroid optimization problems. Theor. Comput. Sci. 410(44), 4471\u20134479 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR20","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1007\/978-1-4939-2864-4","volume-title":"Encyclopedia of Algorithms","author":"F Panolan","year":"2016","unstructured":"Panolan, F., Saurabh, S.: Matroids in parameterized complexity and exact algorithms. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1203\u20131205. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Tatti, N., Gionis, A.: Inferring the strength of social ties: a community-driven approach. In: Proceedings of 23rd ACM SIGKDD, pp. 1017\u20131025. ACM, New York (2017)","DOI":"10.1145\/3097983.3098199"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1142\/S0217595909002080","volume":"26","author":"A Sch\u00f6bel","year":"2009","unstructured":"Sch\u00f6bel, A., Hamacher, H.W., Liebers, A., Wagner, D.: The continuous stop location problem in public transportation networks. Asia Pac. J. Oper. Res. 26(1), 13\u201330 (2009)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"6_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-004-0035-9","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/s10288-004-0035-9"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"49:1","DOI":"10.1145\/2963170","volume":"12","author":"C Swamy","year":"2016","unstructured":"Swamy, C.: Improved approximation algorithms for matroid and knapsack median problems and applications. ACM Trans. Algorithms 12(4), 49:1\u201349:22 (2016)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:27:28Z","timestamp":1710332848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","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":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"95","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":"32% - 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":"14","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)"}}]}}