Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Faster Fixed-Parameter Tractable Algorithms for Matching and Packing ProblemsLecture Notes in Computer Science, 2004
- Finding k Disjoint Triangles in an Arbitrary GraphLecture Notes in Computer Science, 2004
- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) StepsLecture Notes in Computer Science, 2004
- Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPTLecture Notes in Computer Science, 2003
- An FPT Algorithm for Set SplittingLecture Notes in Computer Science, 2003
- Using Nondeterminism to Design Efficient Deterministic AlgorithmsLecture Notes in Computer Science, 2001
- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of PartsLecture Notes in Computer Science, 2000
- Parameterized ComplexityPublished by Springer Nature ,1999
- Better approximation algorithms for Set Splitting and Not-All-Equal SatInformation Processing Letters, 1998
- Color-codingJournal of the ACM, 1995