„Approximation Algorithms“
Suchergebnisse
2.086 Treffer
-
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
-
Simpler and Better Algorithms for Minimum-Norm Load Balancing
-
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond
-
Constant-Factor FPT Approximation for Capacitated k-Median
-
Better Practical Algorithms for rSPR Distance and Hybridization Number
-
Multistage Knapsack
-
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
-
On the Complexity of Local Graph Transformations
-
Toward a Dichotomy for Approximation of H-Coloring
-
Scheduling to Approximate Minimization Objectives on Identical Machines
-
Maintaining Perfect Matchings at Low Cost
-
Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
-
An Improved FPTAS for 0-1 Knapsack
-
Retracting Graphs to Cycles
-
Quantum Chebyshev’s Inequality and Applications
-
Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
-
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
-
Approximation Algorithms for Min-Distance Problems
-
Tight FPT Approximations for k-Median and k-Means
-
On the Fixed-Parameter Tractability of Capacitated Clustering