Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach
- 28 June 2008
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 54 (4) , 472-489
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Improved Algorithms for Weighted and Unweighted Set Splitting ProblemsLecture Notes in Computer Science, 2007
- Divide-and-Color2006
- Improved exact algorithms for MAX-SATDiscrete Applied Mathematics, 2004
- An FPT Algorithm for Set SplittingLecture Notes in Computer Science, 2003
- Splitters and near-optimal derandomization2002
- An Improved Learning Algorithm for Augmented Naive Bayes2001
- Outward rotations1999
- Better approximation algorithms for Set Splitting and Not-All-Equal SatInformation Processing Letters, 1998
- Approximability of maximum splitting of k-sets and some other Apx-complete problemsInformation Processing Letters, 1996
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986