„Approximation Algorithms“
Suchergebnisse
2.086 Treffer
-
09511 Abstracts Collection – Parameterized complexity and approximation algorithms
-
Deterministic approximation algorithms for the nearest codeword problem
-
09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
-
Sharing Supermodular Costs
-
A Robust PTAS for the Parallel Machine Covering Problem
-
08492 Executive Summary – Structured Decompositions and Efficient Algorithms
-
08341 Abstracts Collection – Sublinear Algorithms
-
Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions
-
Exponential-Time Approximation Schemes via Compression
-
Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids
-
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
-
Sidestepping Barriers for Dominating Set in Parameterized Complexity
-
Approximate Maximum Rank Aggregation: Beyond the Worst-Case
-
Temporal Separators with Deadlines
-
Approximation Guarantees for Shortest Superstrings: Simpler and Better
-
Improved Approximation for Two-Dimensional Vector Multiple Knapsack
-
Matrix Completion: Approximating the Minimum Diameter
-
Anonymous Routing Using Minimum Capacity Clustering (Short Paper)
-
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity
-
Improved Diversity Maximization Algorithms for Matching and Pseudoforest