Improved Algorithms for Weighted and Unweighted Set Splitting Problems
Authors:
- 17 August 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 537-547
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Divide-and-Color2006
- Greedy Localization and Color-Coding: Improved Matching and Packing AlgorithmsLecture Notes in Computer Science, 2006
- Improved exact algorithms for MAX-SATDiscrete Applied Mathematics, 2004
- An FPT Algorithm for Set SplittingLecture Notes in Computer Science, 2003
- 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
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984