„FPT-approximation algorithms“
Suchergebnisse
1.000+ Treffer
-
Algorithmic Aspects of Packing Problems
-
Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems
-
Precoloring Extension with Demands on Paths
-
Computational haplotyping – theory and practice
-
Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii
-
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond
-
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
-
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
-
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
-
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
-
Parameterized Approximation Algorithms for TSP
-
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees
-
A Unified Framework of FPT Approximation Algorithms for Clustering Problems
-
FPT Approximation for Constrained Metric k-Median/Means
-
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
-
Constant-Factor FPT Approximation for Capacitated k-Median
-
An Improved FPTAS for 0-1 Knapsack
-
Tight FPT Approximations for k-Median and k-Means
-
A Relaxed FPTAS for Chance-Constrained Knapsack
-
Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center