{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:21:16Z","timestamp":1725603676084},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23719-5_27","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T13:14:33Z","timestamp":1314710073000},"page":"311-322","source":"Crossref","is-referenced-by-count":2,"title":["AdCell: Ad Allocation in Cellular Networks"],"prefix":"10.1007","author":[{"given":"Saeed","family":"Alaei","sequence":"first","affiliation":[]},{"given":"Mohammad T.","family":"Hajiaghayi","sequence":"additional","affiliation":[]},{"given":"Vahid","family":"Liaghat","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Pei","sequence":"additional","affiliation":[]},{"given":"Barna","family":"Saha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Agrawal, M.: Overview of mobile advertising, http:\/\/www.telecomcircle.com\/2009\/11\/overview-of-mobile-advertising","key":"27_CR1"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-27810-8_4","volume-title":"Algorithm Theory - SWAT 2004","author":"N. Andelman","year":"2004","unstructured":"Andelman, N., Mansour, Y.: Auctions with budget constraints. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 26\u201338. Springer, Heidelberg (2004)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-70575-8_16","volume-title":"Automata, Languages and Programming","author":"Y. Azar","year":"2008","unstructured":"Azar, Y., Birnbaum, B., Karlin, A.R., Mathieu, C., Nguyen, C.T.: Improved approximation algorithms for budgeted allocations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 186\u2013197. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. SIAM J. Comp, 2189 (2010)","key":"27_CR4","DOI":"10.1137\/080735503"},{"doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Naor, J.S.: Covering problems with hard capacities. In: FOCS 2002, p. 481 (2002)","key":"27_CR5","DOI":"10.1109\/SFCS.2002.1181972"},{"doi-asserted-by":"crossref","unstructured":"Devenur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC 2009, pp. 71\u201378 (2009)","key":"27_CR6","DOI":"10.1145\/1566374.1566384"},{"doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1\/e. In: FOCS 2009, pp. 117\u2013126 (2009)","key":"27_CR7","DOI":"10.1109\/FOCS.2009.72"},{"doi-asserted-by":"crossref","unstructured":"Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. In: ICALP 2003, pp. 164\u2013175 (2003)","key":"27_CR8","DOI":"10.1007\/3-540-45061-0_15"},{"unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA 2008, pp. 982\u2013991 (2008)","key":"27_CR9"},{"doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC 2004, pp. 71\u201380 (2004)","key":"27_CR10","DOI":"10.1145\/988772.988784"},{"unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: AAAI (2007)","key":"27_CR11"},{"doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: STOC (2011)","key":"27_CR12","DOI":"10.1145\/1993636.1993715"},{"doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC 1990, pp. 352\u2013358 (1990)","key":"27_CR13","DOI":"10.1145\/100216.100262"},{"doi-asserted-by":"crossref","unstructured":"Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc (1977)","key":"27_CR14","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"doi-asserted-by":"crossref","unstructured":"Lahaie, S.: An analysis of alternative slot auction designs for sponsored search. In: EC 2006, pp. 218\u2013227 (2006)","key":"27_CR15","DOI":"10.1145\/1134707.1134731"},{"doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: An approach based on strongly factor-revealing lps. In: STOC (2011)","key":"27_CR16","DOI":"10.1145\/1993636.1993716"},{"doi-asserted-by":"crossref","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: Online actions based on offline statistics. In: SODA (2011)","key":"27_CR17","DOI":"10.1137\/1.9781611973082.98"},{"doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM\u00a054 (2007)","key":"27_CR18","DOI":"10.1145\/1284320.1284321"},{"doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, E., Wexler, T.: Facility location with nonuniform hard capacities. In: FOCS 2001, pp. 329\u2013338 (2001)","key":"27_CR19","DOI":"10.1109\/SFCS.2001.959907"},{"unstructured":"Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: ICS 2010, pp. 342\u2013357 (2010)","key":"27_CR20"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-85363-3_20","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Srinivasan","year":"2008","unstructured":"Srinivasan, A.: Budgeted allocations in the full-information setting. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX 2008. LNCS, vol.\u00a05171, pp. 247\u2013253. Springer, Heidelberg (2008)"},{"unstructured":"Wang, S., Min, J., Yi, B.K.: Location based services for mobiles: Technologies and standards. In: ICC (2008)","key":"27_CR22"},{"unstructured":"Zahradnik, F.: Garmin to offer free, advertising-supported traffic detection and avoidance, http:\/\/gps.about.com\/b\/2008\/09\/15\/garmin-to-offer-free-advertising-supported-traffic-detection-and-avoidance.htm","key":"27_CR23"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:08:49Z","timestamp":1560528529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}