„kernelization algorithms“
Suchergebnisse
65 Treffer
-
Linear-Time Kernelization for Feedback Vertex Set
-
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
-
Parameterized and Approximation Algorithms for the Load Coloring Problem
-
Bidimensionality and Parameterized Algorithms (Invited Talk)
-
Partially Polynomial Kernels for Set Cover and Test Cover
-
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
-
Polynomial Kernelizations for MIN F^+Pi_1 and MAX NP
-
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
-
Parameterized Algorithms and Data Reduction for Safe Convoy Routing
-
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)
-
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)
-
Parameterized and Exact Computation – 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers
-
On optimal streaming kernelization algorithms
-
Improved kernelization and fixed-parameter algorithms for bicluster editing
-
Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data
-
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
-
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
-
Big data algorithms beyond machine learning
-
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
-
Linear kernels and linear-time algorithms for finding large cuts