{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:46:48Z","timestamp":1725490008874},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_52","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"537-547","source":"Crossref","is-referenced-by-count":4,"title":["Improved Algorithms for Weighted and Unweighted Set Splitting Problems"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songjian","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms\u00a07, 567\u2013683 (1986)","journal-title":"Journal of Algorithms"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, G., Engebretsen, L.: Better approximation algorithms and tighter analysis for set splitting and not-all-equal sat. In: ECCCTR: Electronic colloquium on computational complexity (1997)","DOI":"10.1016\/S0020-0190(98)00021-0"},{"key":"52_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2003.03.002","volume":"142","author":"J. Chen","year":"2004","unstructured":"Chen, J., Kanj, I.: Improved Exact Algorithms for Max-Sat. Discrete Applied Mathematics\u00a0142, 17\u201327 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"52_CR5","unstructured":"Chen, J., Lu, S., Sze, S., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: SODA, pp. 298\u2013307 (2007)"},{"key":"52_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-540-39890-5_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"F. Dehne","year":"2003","unstructured":"Dehne, F., Fellows, M., Rosamond, F.: An FPT Algorithm for Set Splitting. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 180\u2013191. Springer, Heidelberg (2003)"},{"key":"52_CR7","series-title":"Lecture Notes in Computer Science","first-page":"127","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2004","unstructured":"Dehne, F., Fellows, M., Rosamond, F., Shaw, P.: Greedy localization, iterative compression, modeled crown reductions: new FPT techniques, and improved algorithm for set splitting, and a novel 2k kernelization of vertex cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 127\u2013137. Springer, Heidelberg (2004)"},{"key":"52_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"52_CR9","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M. Fredman","year":"1984","unstructured":"Fredman, M., Komlos, J., Szemeredi, E.: Storing a sparse table with O(1) worst case access time. Journal of the ACM\u00a031, 538\u2013544 (1984)","journal-title":"Journal of the ACM"},{"key":"52_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"3","key":"52_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0020-0190(96)00046-4","volume":"58","author":"V. Kann","year":"1996","unstructured":"Kann, V., Lagergren, J., Panconesi, A.: Approximability of maximum splitting of k-sets and some other apx-complete problems. Information Processing Letters\u00a058(3), 105\u2013110 (1996)","journal-title":"Information Processing Letters"},{"key":"52_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11917496_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2006","unstructured":"Kneis, J., Molle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 58\u201367. Springer, Heidelberg (2006)"},{"key":"52_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11847250_8","volume-title":"Parameterized and Exact Computation","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., Lu, S., Chen, J., Sze, S.: Greedy localization and color-coding: Improved Matching and Packing Algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 84\u201395. Springer, Heidelberg (2006)"},{"key":"52_CR14","first-page":"105","volume":"4","author":"D. Lokshtanov","year":"2005","unstructured":"Lokshtanov, D., Sloper, C.: Fixed parameter set splitting, linear kernel and improved running time. Algorithms and Complexity in Durham 2005, King\u2019s College Press, Texts in Algorithmics\u00a04, 105\u2013113 (2005)","journal-title":"Algorithms and Complexity in Durham 2005, King\u2019s College Press, Texts in Algorithmics"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: FOCS, pp. 182\u2013190 (1995)","DOI":"10.1109\/SFCS.1995.492475"},{"key":"52_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-45357-1_62","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Zhang","year":"2001","unstructured":"Zhang, H., Ling, C.: An improved learning algorithm for augmented naive bayes. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol.\u00a02035, pp. 581\u2013586. Springer, Heidelberg (2001)"},{"key":"52_CR17","unstructured":"Zwick, U.: Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In: SODA, pp. 201\u2013220 (1998)"},{"key":"52_CR18","doi-asserted-by":"crossref","unstructured":"Zwick, U.: Outward rotations: A tool for rounding solutions of semidefinite programming relaxation, with applications to max cut and other problem. In: STOC, pp. 679\u2013687 (1999)","DOI":"10.1145\/301250.301431"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T20:42:31Z","timestamp":1684010551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}