{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:54:09Z","timestamp":1743087249851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031813955"},{"type":"electronic","value":"9783031813962"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81396-2_1","type":"book-chapter","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:14:27Z","timestamp":1739315667000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the\u00a0Price-of-Fair-Sharing Using Knapsack-Cover Constraints to\u00a0Guide Near-Optimal Cost-Recovery Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1852-9116","authenticated-orcid":false,"given":"Sander","family":"Aarts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-7049-4444","authenticated-orcid":false,"given":"Jacob","family":"Dentes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-4163","authenticated-orcid":false,"given":"Manxi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3882-901X","authenticated-orcid":false,"given":"David B.","family":"Shmoys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"unstructured":"LPWAN Market. https:\/\/iot-analytics.com\/lpwan-market\/. Accessed 29 Jun 2024","key":"1_CR1"},{"unstructured":"Aarts, S., Shmoys, D.B., Coy, A.: An interpretable determinantal choice model for subset selection (2023)","key":"1_CR2"},{"doi-asserted-by":"crossref","unstructured":"Carnes, T., Shmoys, D.: Primal-dual schema for capacitated covering problems. In: 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008, Bertinoro, Italy, 26\u201328 May 2008 Proceedings 13, pp. 288\u2013302. Springer (2008)","key":"1_CR3","DOI":"10.1007\/978-3-540-68891-4_20"},{"unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201900, pp. 106\u2013115. Society for Industrial and Applied Mathematics, USA (2000)","key":"1_CR4"},{"doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: On Approximating (Sparse) Covering Integer Programs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1596\u20131615. SIAM (2019)","key":"1_CR5","DOI":"10.1137\/1.9781611975482.97"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/rsa.20964","volume":"58","author":"A Chen","year":"2021","unstructured":"Chen, A., Harris, D.G., Srinivasan, A.: Partial resampling to approximate covering integer programs. Random Struct. Algorithms 58(1), 68\u201393 (2021)","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Mihail, M., Vazirani, V.V.: Strategyproof cost-sharing mechanisms for set cover and facility location games. In: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 108\u2013114 (2003)","key":"1_CR8","DOI":"10.1145\/779928.779942"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G Dobson","year":"1982","unstructured":"Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Math. Oper. Res. 7(4), 515\u2013531 (1982)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1_CR10","first-page":"966","volume":"65","author":"GR Faulhaber","year":"1975","unstructured":"Faulhaber, G.R.: Cross-subsidization: pricing in public enterprises. Am. Econ. Rev. 65(5), 966\u2013977 (1975)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"1_CR11","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 ln n for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0196-6774(03)00098-1","volume":"50","author":"MX Goemans","year":"2004","unstructured":"Goemans, M.X., Skutella, M.: Cooperative facility location games. J. Algorithms 50(2), 194\u2013214 (2004)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., P\u00e1l, M., Roughgarden, T.: Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 606\u2013615. IEEE (2003)","key":"1_CR13","DOI":"10.1109\/SFCS.2003.1238233"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1109\/T-VT.1980.23859","volume":"29","author":"M Hata","year":"1980","unstructured":"Hata, M.: Empirical formula for propagation loss in land mobile radio services. IEEE Trans. Veh. Technol. 29, 317\u2013325 (1980)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1361192.1361201","volume":"4","author":"N Immorlica","year":"2008","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms (TALG) 4(2), 1\u201325 (2008)","journal-title":"ACM Trans. Algorithms (TALG)"},{"doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M.: Cost Sharing, pp. 385-410. Cambridge University Press (2007)","key":"1_CR16","DOI":"10.1017\/CBO9780511800481.017"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/060658448","volume":"38","author":"K Jain","year":"2008","unstructured":"Jain, K., Vazirani, V.V.: Equitable cost allocations via primal-dual-type algorithms. SIAM J. Comput. 38(1), 241\u2013256 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering\/packing integer programs. J. Comput. Syst. Sci. 71(4), 495\u2013505 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"1_CR19","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1137\/050646408","volume":"37","author":"J K\u00f6nemann","year":"2008","unstructured":"K\u00f6nemann, J., Leonardi, S., Sch\u00e4fer, G., van Zwam, S.H.: A group-strategyproof cost sharing mechanism for the Steiner forest game. SIAM J. Comput. 37(5), 1319\u20131341 (2008)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. In: 18th Annual Symposium on Foundations of Computer Science, SFCS 1977, pp. 206\u2013213. IEEE (1977)","key":"1_CR20","DOI":"10.1109\/SFCS.1977.11"},{"doi-asserted-by":"crossref","unstructured":"Leonardi, S., Sch\u00e4fer, G.: Cross-monotonic cost sharing methods for connected facility location games. Theor. Comput. Sci. 326(1), 431\u2013442 (2004). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397504004876","key":"1_CR21","DOI":"10.1016\/j.tcs.2004.07.033"},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10878-009-9209-x","volume":"20","author":"XY Li","year":"2010","unstructured":"Li, X.Y., Sun, Z., Wang, W., Lou, W.: Cost sharing and strategyproof mechanisms for set cover games. J. Comb. Optim. 20(3), 259\u2013284 (2010)","journal-title":"J. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Meir, R., Bachrach, Y., Rosenschein, J.S.: Minimal subsidies in expense sharing games. In: Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, 18\u201320 October 2010, Proceedings 3, pp. 347\u2013358. Springer (2010)","key":"1_CR23","DOI":"10.1007\/978-3-642-16170-4_30"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategyproof sharing of submodular costs: budget balance versus efficiency. Econ. Theor. 18, 511\u2013533 (2001)","journal-title":"Econ. Theor."},{"doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003, pp. 584\u2013593. IEEE (2003)","key":"1_CR25","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1008060716167","volume":"13","author":"SG Parsons","year":"1998","unstructured":"Parsons, S.G.: Cross-subsidization in telecommunications. J. Regul. Econ. 13, 157\u2013182 (1998)","journal-title":"J. Regul. Econ."},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"SA Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20(2), 257\u2013301 (1995)","journal-title":"Math. Oper. Res."},{"unstructured":"Semtech: LoRa\u00ae and LoRaWAN\u00ae: a technical overview. https:\/\/lora-developers.semtech.com\/documentation\/tech-papers-and-guides\/lora-and-lorawan\/. Accessed 07 Sept 2021","key":"1_CR28"},{"unstructured":"Semtech: Network Providers. https:\/\/www.semtech.com\/lora\/ecosystem\/networks. Accessed 29 Jun 2024","key":"1_CR29"},{"issue":"4","key":"1_CR30","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.orl.2019.03.015","volume":"47","author":"M Singh","year":"2019","unstructured":"Singh, M.: Integrality gap of the vertex cover linear programming relaxation. Oper. Res. Lett. 47(4), 288\u2013290 (2019)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","key":"1_CR31","DOI":"10.1017\/CBO9780511921735"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81396-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:14:32Z","timestamp":1739315672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81396-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031813955","9783031813962"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81396-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"12 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}