{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:07:46Z","timestamp":1765544866446,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_9","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"94-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for\u00a0Capacitated Assignment with\u00a0Budget Constraints and\u00a0Applications in\u00a0Transportation Systems"],"prefix":"10.1007","author":[{"given":"Hongyi","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samitha","family":"Samaranayake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1137\/120878422","volume":"43","author":"S Alaei","year":"2014","unstructured":"Alaei, S.: Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers. SIAM J. Comput. 43(2), 930\u2013972 (2014)","journal-title":"SIAM J. Comput."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-40328-6_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S Alaei","year":"2013","unstructured":"Alaei, S., Hajiaghayi, M.T., Liaghat, V.: The online stochastic generalized assignment problem. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2013. LNCS, vol. 8096, pp. 11\u201325. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40328-6_2"},{"issue":"6\u20138","key":"9_CR3","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.ipl.2015.02.001","volume":"115","author":"M Bender","year":"2015","unstructured":"Bender, M., Thielen, C., Westphal, S.: Packing items into several bins facilitates approximating the separable assignment problem. Inf. Process. Lett. 115(6\u20138), 570\u2013575 (2015)","journal-title":"Inf. Process. Lett."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Boeing, G.: OSMnx: a python package to work with graph-theoretic OpenStreetMap street networks. J. Open Sour. Softw. 2(12) (2017)","DOI":"10.21105\/joss.00215"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/trsc.1060.0161","volume":"41","author":"R Bornd\u00f6rfer","year":"2007","unstructured":"Bornd\u00f6rfer, R., Gr\u00f6tschel, M., Pfetsch, M.E.: A column-generation approach to line planning in public transport. Transp. Sci. 41(1), 123\u2013132 (2007)","journal-title":"Transp. Sci."},{"key":"9_CR6","unstructured":"Bornd\u00f6rfer, R., Karbstein, M.: A direct connection approach to integrated line planning and passenger routing. In: 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2012)"},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, 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."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR9","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)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: improving the factor of 1\u20131\/e. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 667\u2013676. IEEE (2006)","DOI":"10.1109\/FOCS.2006.14"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/moor.1110.0499","volume":"36","author":"L Fleischer","year":"2011","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum separable assignment problems. Math. Oper. Res. 36(3), 416\u2013431 (2011)","journal-title":"Math. Oper. Res."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, H., Samaranayake, S.: Approximation algorithms for capacitated assignment with budget constraints and applications in transportation systems. arXiv preprint arXiv:2208.11832 (2022)","DOI":"10.1007\/978-3-031-22105-7_9"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1287\/moor.2013.0592","volume":"38","author":"A Kulik","year":"2013","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Approximations for monotone and nonmonotone submodular maximization with knapsack constraints. Math. Oper. Res. 38(4), 729\u2013739 (2013)","journal-title":"Math. Oper. Res."},{"key":"9_CR14","unstructured":"Nachtigall, K., Jerosch, K.: Simultaneous network line planning and traffic assignment. In: 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2008)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3460091","volume":"5","author":"N P\u00e9rivier","year":"2021","unstructured":"P\u00e9rivier, N., Hssaine, C., Samaranayake, S., Banerjee, S.: Real-time approximate routing for smart transit systems. Proc. ACM Meas. Anal. Comput. Syst. 5(2), 1\u201330 (2021)","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0305-0548(74)90046-X","volume":"1","author":"LA Silman","year":"1974","unstructured":"Silman, L.A., Barzily, Z., Passy, U.: Planning the route system for urban buses. Comput. Oper. Res. 1(2), 201\u2013211 (1974)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:03:42Z","timestamp":1680213822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}