conftrace_

approximation algorithm

630 papers

Explore in graph

Also known as

APPROX

Co-occurring keywords

combinatorial optimization (1039) submodular maximization (143) submodular optimization (261) k-means clustering (235) greedy algorithm (242) mechanism design (340) fair division (158) submodular function (121) hierarchical clustering (232) graph algorithm (178)

Papers

On Testing of Samplers NIPS 2020
Optimal approximation for unconstrained non-submodular minimization ICML 2020
Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources AAAI 2020
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination AAAI 2020
Strategyproof Mechanisms for Friends and Enemies Games AAAI 2020
Defending with Shared Resources on a Network AAAI 2020
Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint AISTATS 2020
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NIPS 2020
Balancing Spreads of Influence in a Social Network AAAI 2020
Approximation Schemes for ReLU Regression COLT 2020
An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means AAAI 2020
On the Problem of Covering a 3-D Terrain AAAI 2020
“Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020
Fair Division: The Computer Scientist’s Perspective IJCAI 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NIPS 2020
Correlation Robust Influence Maximization NIPS 2020
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms AAAI 2020
Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives AAAI 2020
Robust Algorithms for Online $k$-means Clustering ALT 2020
Adversarial Blocking Bandits NIPS 2020
Differentially Private Clustering: Tight Approximation Ratios NIPS 2020
Improved Guarantees for k-means++ and k-means++ Parallel NIPS 2020
Uniform Welfare Guarantees Under Identical Subadditive Valuations IJCAI 2020
Fair Correlation Clustering AISTATS 2020
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection AISTATS 2020