{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:23:29Z","timestamp":1773797009295,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228943","type":"print"},{"value":"9783540278214","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_7","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T18:54:06Z","timestamp":1284490446000},"page":"72-83","source":"Crossref","is-referenced-by-count":97,"title":["Maximum Coverage Problem with Group Budget Constraints and Applications"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ageev, A., Sviridenko, M.: Pipage Rounding: a New Method of Constructing Algorithms with Proven Performance Guarantee. J. of Combinatorial Optimization (to appear)","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Arkin, E., Mitchell, J., Narasimhan, G.: Resource-constrained geometric network optimization. In: Proceedings of SoCG (1998)","DOI":"10.1145\/276884.276919"},{"key":"7_CR3","unstructured":"S. Arora and G. Karakostas. A 2 + \u03b5 approximation for the k-MST problem. In Proceedings of SODA, 2000."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-39658-1_8","volume-title":"Algorithms - ESA 2003","author":"R. Bar-Yehuda","year":"2003","unstructured":"Bar-Yehuda, R., Even, G., Sahar, S.: On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 55\u201366. Springer, Heidelberg (2003)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of STOC (1994)","DOI":"10.1145\/195058.195125"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time-Windows. In: Proc. of STOC (2004)","DOI":"10.1145\/1007352.1007385"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Blum, A., Chawla, S., Karger, D., Lane, T., Meyerson, A., Minkoff, M.: Approximation Algorithms for Orienteering and Discounted-Reward TSP. In: Proc. of FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238180"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees and minimum latency tours. In: Proc. of FOCS (2003)","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"7_CR9","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the Multiple Knapsack Problem. In: Proc. of SODA (2000)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_19","volume-title":"Automata, Languages and Programming","author":"M. Elkin","year":"2003","unstructured":"Elkin, M., Kortsarz, G.: Approximation Algorithm for the Directed Telephone Multicast Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, Springer, Heidelberg (2003)"},{"key":"7_CR11","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-Traveling Repairmen Problem. In: Proceedings of SODA (2003)"},{"issue":"4","key":"7_CR12","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. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: Proceedings of FOCS (1996)","DOI":"10.1109\/SFCS.1996.548489"},{"key":"7_CR14","unstructured":"Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: Proceedings of SODA (1996)"},{"key":"7_CR15","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D. Hochbaum","year":"1996","unstructured":"Hochbaum, D.:(ed.) Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1996)"},{"key":"7_CR16","unstructured":"Kortsarz, G.: Personal communication (July 2003)"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S. Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The Budgeted Maximum Coverage Problem. Information Processing Letters\u00a070(1), 39\u201345 (1999)","journal-title":"Information Processing Letters"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with Applications to Approximation Algorithms. In: Proc. of FOCS (2001)","DOI":"10.1109\/SFCS.2001.959935"},{"key":"7_CR19","first-page":"228","volume":"22","author":"J. Tsitsikilis","year":"1992","unstructured":"Tsitsikilis, J.: Special Cases of Traveling Salesman Problem and Repairmen Problems with Time Windows. Networks\u00a022, 228\u2013263 (1992)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:01Z","timestamp":1620012601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}