An FPT Algorithm for Set Splitting
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Solving large FPT problems on coarse-grained parallel machinesJournal of Computer and System Sciences, 2003
- Subexponential Parameterized Algorithms Collapse the W-HierarchyLecture Notes in Computer Science, 2001
- An Improved Learning Algorithm for Augmented Naive BayesLecture Notes in Computer Science, 2001
- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of PartsLecture Notes in Computer Science, 2000
- Fixed Parameter Algorithms for Planar Dominating Set and Related ProblemsLecture Notes in Computer Science, 2000
- Outward rotationsPublished by Association for Computing Machinery (ACM) ,1999
- 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
- The hardness of approximation: Gap locationcomputational complexity, 1994
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973