{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:51:29Z","timestamp":1743087089104,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_29","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"399-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Pricing with Limited Supply"],"prefix":"10.1007","author":[{"given":"Zachary","family":"Friggstad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Mahboub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.ejor.2006.12.063","volume":"191","author":"E Alekseeva","year":"2008","unstructured":"Alekseeva, E., Kochetov, Y., Alexsandr, P.: Complexity of local search for the p-median problem. Eur. J. Oper. Res. 191(3), 736\u2013752 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"29_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4086\/toc.2007.v003a009","volume":"3","author":"MF Balcan","year":"2007","unstructured":"Balcan, M.F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. Theory Comput. 3(9), 179\u2013195 (2007)","journal-title":"Theory Comput."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-minded unlimited supply setting pricing on sparse instances. In: Proceedings of SODA, pp. 1093\u20131102 (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-32512-0_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P Chalermsook","year":"2012","unstructured":"Chalermsook, P., Chuzhoy, J., Kannan, S., Khanna, S.: Improved hardness results for profit maximization pricing problems with unlimited supply. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM -2012. LNCS, vol. 7408, pp. 73\u201384. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32512-0_7"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: Proceedings of FOCS, pp. 35\u201344 (2008)","DOI":"10.1109\/FOCS.2008.15"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-17572-5_39","volume-title":"Internet and Network Economics","author":"K Elbassioni","year":"2010","unstructured":"Elbassioni, K., Fouz, M., Swamy, C.: Approximation algorithms for non-single-minded profit-maximization problems with limited supply. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 462\u2013472. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_39"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Khodamoradi, K., Salavatipour, M.R.: Exact algorithms and lower bounds for stable instances of euclidean $$k$$-means. In: Proceedings of SODA, pp. 2958\u20132972 (2019)","DOI":"10.1137\/1.9781611975482.183"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/978-3-642-14165-2_49","volume-title":"Automata, Languages and Programming","author":"I Gamzu","year":"2010","unstructured":"Gamzu, I., Segev, D.: A sublogarithmic approximation for highway and tollbooth pricing. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 582\u2013593. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_49"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Rothvo\u00df, T.: Pricing on paths: a PTAS for the highway problem. In: Proceedings of SODA, pp. 675\u2013684 (2011)","DOI":"10.1137\/1.9781611973082.53"},{"key":"29_CR10","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, BC, Canada, 23\u201325 January 2005, pp. 1164\u20131173 (2005)"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-03685-9_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R Khandekar","year":"2009","unstructured":"Khandekar, R., Kimbrel, T., Makarychev, K., Sviridenko, M.: On hardness of pricing items for single-minded bidders. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM -2009. LNCS, vol. 5687, pp. 202\u2013216. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_16"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Lee, E.: Hardness of graph pricing through generalized Max-Dicut. In: Proceedings of the Forty-seventh Annual ACM Symposium on Theory of Computing, pp. 391\u2013399 (2015)","DOI":"10.1145\/2746539.2746549"},{"key":"29_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1112\/jlms\/s1-38.1.423","volume":"1","author":"H Sachs","year":"1963","unstructured":"Sachs, H.: Regular graphs with given girth and restricted circuits. J. Lond. Math. Soc. 1(1), 423\u2013429 (1963)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:28:20Z","timestamp":1645183700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"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.1","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":"13","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)"}}]}}