{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:00:14Z","timestamp":1725516014797},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_3","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"3-14","source":"Crossref","is-referenced-by-count":1,"title":["On the Minimum Hitting Set of Bundles Problem"],"prefix":"10.1007","author":[{"given":"Eric","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences\u00a021(1), 136\u2013153 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s00224-005-1140-7","volume":"38","author":"A. Avidor","year":"2005","unstructured":"Avidor, A., Zwick, U.: Approximating MIN 2-SAT and MIN 3-SAT. Theory of Computer Systems\u00a038(3), 329\u2013345 (2005)","journal-title":"Theory of Computer Systems"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0167-6377(99)00010-3","volume":"24","author":"D. Bertsimas","year":"1999","unstructured":"Bertsimas, D., Teo, C.-P., Vohra, R.: On dependent randomized rounding algorithms. Operation Research Letters\u00a024(3), 105\u2013114 (1999)","journal-title":"Operation Research Letters"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proceedings of STOC 2003, pp. 595\u2013601 (2003)","DOI":"10.1145\/780542.780629"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: The importance of being biased. In: Proceedings of STOC 2002, pp. 33\u201342 (2002)","DOI":"10.1145\/509907.509915"},{"issue":"5","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E. Halperin","year":"2002","unstructured":"Halperin, E.: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs. SIAM J. Comput.\u00a031(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S0895480191220836","volume":"7","author":"R. Kohli","year":"1994","unstructured":"Kohli, R., Krishnamurty, R., Mirchandani, P.: The minimum satisfiability problem. SIAM Journal on Discrete Mathematics\u00a07, 275\u2013283 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(96)00031-2","volume":"58","author":"M.V. Marathhe","year":"1996","unstructured":"Marathhe, M.V., Ravi, S.S.: On approximation algorithms for the minimum satisfiability problem. Information Processing Letters\u00a058, 23\u201329 (1996)","journal-title":"Information Processing Letters"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ipl.2004.06.018","volume":"92","author":"I.H. Toroslu","year":"2004","unstructured":"Toroslu, I.H., Cosar, A.: Dynamic programming solution for multiple query optimization problem. Information Processing Letters\u00a092(3), 149\u2013155 (2004)","journal-title":"Information Processing Letters"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/42201.42203","volume":"13","author":"T.K. Sellis","year":"1988","unstructured":"Sellis, T.K.: Multiple-Query Optimization. Transactions on Database Systems\u00a013(1), 23\u201352 (1988)","journal-title":"Transactions on Database Systems"},{"key":"3_CR11","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:07Z","timestamp":1620015427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}