{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T20:55:34Z","timestamp":1725828934612},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662483497"},{"type":"electronic","value":"9783662483503"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_24","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"275-287","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Approximation Algorithm for Knapsack Median Using Sparsification"],"prefix":"10.1007","author":[{"given":"Jaroslaw","family":"Byrka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Pensyl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Rybicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khoa","family":"Trinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for k-median, and positive correlation in budgeted optimization. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 737\u2013756 (2015)","DOI":"10.1137\/1.9781611973730.50"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guha, S., Tardos, \u00c9., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: ACM Symposium on Theory of Computing (STOC), pp. 1\u201310. ACM (1999)","DOI":"10.1145\/301250.301257"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-31594-7_17","volume-title":"Automata, Languages, and Programming","author":"M. Charikar","year":"2012","unstructured":"Charikar, M., Li, S.: A dependent lp-rounding approach for the k-median problem. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 194\u2013205. Springer, Heidelberg (2012)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Kumar, A., Nagarajan, V., Sabharwal, Y., Saha, B.: The matroid median problem. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1117\u20131130. SIAM (2011)","DOI":"10.1137\/1.9781611973082.84"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Kumar, A.: Constant factor approximation algorithm for the knapsack median problem. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 824\u2013832. SIAM (2012)","DOI":"10.1137\/1.9781611973099.66"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Li, S., Svensson, O.: Approximating k-median via pseudo-approximation. In: STOC, pp. 901\u2013910 (2013)","DOI":"10.1145\/2488608.2488723"},{"key":"24_CR7","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency, vol.\u00a024. Springer Science & Business Media (2003)"},{"key":"24_CR8","unstructured":"Swamy, C.: Improved approximation algorithms for matroid and knapsack median problems and applications. In: APPROX\/RANDOM 2014, vol.\u00a028, pp. 403\u2013418 (2014)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T11:51:19Z","timestamp":1691927479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}