„FPT algorithm“
Suchergebnisse
175 Treffer
-
Constant-Factor FPT Approximation for Capacitated k-Median
-
Parameterized Complexity of Conflict-Free Matchings and Paths
-
Faster FPT Algorithm for 5-Path Vertex Cover
-
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
-
An Improved FPTAS for 0-1 Knapsack
-
Tight FPT Approximations for k-Median and k-Means
-
A Relaxed FPTAS for Chance-Constrained Knapsack
-
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes
-
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
-
The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration
-
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
-
Dual Parameterization of Weighted Coloring
-
FPT Algorithms for Embedding into Low Complexity Graphic Metrics
-
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable
-
Parameterized Algorithms for Zero Extension and Metric Labelling Problems
-
Parameterized Orientable Deletion
-
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
-
Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center
-
An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
-
On the Parameterized Complexity of Red-Blue Points Separation