Improved parameterized set splitting algorithms: A probabilistic approach

Algorithmica (New York)

Volumn 54, Issue 4, 2009, Pages 472-489

  Chen, Jianer ^a   Lu, Songjian ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Derandomization; Parametrized algorithm; Randomized algorithm; Set splitting

Indexed keywords

DERANDOMIZATION; DETERMINISTIC ALGORITHMS; KERNELIZATION; PARAMETERIZED; PARAMETERIZED ALGORITHMS; PARAMETRIZED ALGORITHM; PROBABILISTIC APPROACHES; PROBABILISTIC METHODS; RANDOMIZED ALGORITHM; RUNNING TIME; SET SPLITTING; WEIGHTED SETS;

ALGORITHMS;

EID: 67349186211     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9206-y     Document Type: Article

References (19)

1. N. Alon L. Babai A. Itai 1986 A fast and simple randomized parallel algorithm for the maximal independent set problem J. Algorithms 7 567 683
2. 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)
3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)
4. J. Chen I. Kanj 2004 Improved exact algorithms for Max-Sat Discrete Appl. Math. 142 17 27
5. Chen, J., Lu, S.: Improved algorithm for weighted and unweighted set splitting problems. In: COCOON 2007. Lecture Notes in Computer Science, vol. 4598, pp. 573-547 (2007)
6. Chen, J., Lu, S., Sze, S., Zhang, F.
7. Dehne, F., Fellows, M., Rosamond, F.: An FPT algorithm for set splitting. In: WG 2003. Lecture Notes in Computer Science, vol. 2880, pp. 180-191 (2003)
8. 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: IWPEC 2004. Lecture Notes in Computer Science, vol. 3162, pp. 127-137 (2004)
9. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
10. M. Fredman J. Komlos E. Szemeredi 1984 Storing a sparse table with O(1) worst case access time J. ACM 31 538 544
11. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
12. Hardy, G., Wright, E.: An Introduction to the Theory of Numbers, 5th ed. Oxford University Press, London (1978)
13. V. Kann J. Lagergren A. Panconesi 1996 Approximability of maximum splitting of k-sets and some other APX-complete problems Inf. Process. Lett. 58 105 110 (Pubitemid 126374645)
14. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: WG 2006. Lecture Notes in Computer Science, vol. 4271, pp. 58-67 (2006)
15. Lokshtanov, D., Sloper, C.: Fixed parameter set splitting, linear kernel and improved running time. In: Algorithms and Complexity in Durham 2005. Texts in Algorithmics, vol. 4, pp. 105-113. King's College Press, London (2005)
16. Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 36th IEEE Symp. on Foundations of Computer Science (FOCS 1995), pp. 182-190 (1995)
17. Zhang, H., Ling, C.: An improved learning algorithm for augmented naive Bayes. In: PAKDD 2001. Lecture Notes in Computer Science, vol. 2035, pp. 581-586 (2001)
18. Zwick, U.: Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In: Proc. of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 201-220 (1998)
19. Zwick, U.: Outward rotations: A tool for rounding solutions of semidefinite programming relaxation, with applications to max cut and other problem. In: Proc. of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC 1999), pp. 679-687 (1999)