{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:21Z","timestamp":1725745281749},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_9","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T13:17:34Z","timestamp":1376659054000},"page":"110-125","source":"Crossref","is-referenced-by-count":3,"title":["Partial Interval Set Cover \u2013 Trade-Offs between Scalability and Optimality"],"prefix":"10.1007","author":[{"given":"Katherine","family":"Edwards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Griffiths","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William Sean","family":"Kennedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Transactions on Algorithms (TALG)\u00a02(2), 153\u2013177 (2006)","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. Journal of Algorithms\u00a039(2), 137\u2013144 (2001)","journal-title":"Journal of Algorithms"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1401890.1401902","volume-title":"Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008","author":"F. Bonchi","year":"2008","unstructured":"Bonchi, F., Castillo, C., Donato, D., Gionis, A.: Topical query decomposition. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008, pp. 52\u201360. ACM, New York (2008)"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research\u00a04(3), 233\u2013235 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR5","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education (2001)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/1871437.1871501","volume-title":"Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010","author":"G. Cormode","year":"2010","unstructured":"Cormode, G., Karloff, H., Wirth, A.: Set cover algorithms for very large datasets. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM 2010, pp. 479\u2013488. ACM, New York (2010)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.cie.2011.08.020","volume":"62","author":"R.Z. Farahani","year":"2012","unstructured":"Farahani, R.Z., Asgari, N., Heidari, N., Hosseininia, M., Goh, M.: Survey: Covering problems in facility location: A review. Comput. Ind. Eng.\u00a062(1), 368\u2013407 (2012)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R. Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms\u00a053(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1145\/1281192.1281228","volume-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2007","author":"B.J. Gao","year":"2007","unstructured":"Gao, B.J., Ester, M., Cai, J.-Y., Schulte, O., Xiong, H.: The minimum consistent subset cover problem and its applications in data mining. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2007, pp. 310\u2013319. ACM, New York (2007)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"574","DOI":"10.14778\/1687627.1687693","volume":"2","author":"L. Golab","year":"2009","unstructured":"Golab, L., Karloff, H., Korn, F., Saha, A., Srivastava, D.: Sequential dependencies. Proc. VLDB Endow.\u00a02(1), 574\u2013585 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"9_CR11","doi-asserted-by":"crossref","first-page":"376","DOI":"10.14778\/1453856.1453900","volume":"1","author":"L. Golab","year":"2008","unstructured":"Golab, L., Karloff, H., Korn, F., Srivastava, D., Yu, B.: On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB Endow.\u00a01(1), 376\u2013390 (2008)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"9_CR12","doi-asserted-by":"publisher","first-page":"3520","DOI":"10.1016\/j.cor.2005.03.030","volume":"33","author":"F.C. Gomes","year":"2006","unstructured":"Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Comput. Oper. Res.\u00a033(12), 3520\u20133534 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/TCBB.2009.54","volume":"8","author":"Z. He","year":"2011","unstructured":"He, Z., Yang, C., Yu, W.: A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a08(2), 368\u2013380 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. J. Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: 50 Years of Integer Programming 1958-2008, pp. 219\u2013241 (2010)","DOI":"10.1007\/978-3-540-68279-0_8"},{"key":"9_CR16","unstructured":"Kearns, M.J.: The computational complexity of machine learning. The MIT Press (1990)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-92248-3_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2008","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Improved upper bounds for partial vertex cover. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 240\u2013251. Springer, Heidelberg (2008)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/11841036_43","volume-title":"Algorithms \u2013 ESA 2006","author":"J. K\u00f6nemann","year":"2006","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 468\u2013479. Springer, Heidelberg (2006)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-3-540-48413-4_7","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Mihail","year":"1999","unstructured":"Mihail, M.: Set Cover with Requirements and Costs Evolving over Time. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM-APPROX 1999. LNCS, vol.\u00a01671, pp. 63\u201372. Springer, Heidelberg (1999)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1145\/258533.258641","volume-title":"Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC 1997","author":"R. Raz","year":"1997","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 475\u2013484. ACM, New York (1997)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 435\u2013441. ACM (1996)","DOI":"10.1145\/237814.237991"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:49:58Z","timestamp":1558316998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}