Skip to content
conftrace_

approximation algorithm

676 papers

APPROX

Papers

Learning Augmented Energy Minimization via Speed Scaling NeurIPS 2020 Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination AAAI 2020 Myersonian Regression NeurIPS 2020 Non-monotone DR-submodular Maximization over General Convex Sets IJCAI 2020 Online MAP Inference of Determinantal Point Processes NeurIPS 2020 On Testing of Samplers NeurIPS 2020 On the Problem of Covering a 3-D Terrain AAAI 2020 Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization JMLR 2020 Optimal approximation for unconstrained non-submodular minimization ICML 2020 Optimal Common Contract with Heterogeneous Agents AAAI 2020 Optimally Guarding Perimeters and Regions with Mobile Range Sensors RSS 2020 Optimal Region Search with Submodular Maximization IJCAI 2020 Optimization from Structured Samples for Coverage Functions ICML 2020 Optimization of Chance-Constrained Submodular Functions AAAI 2020 Parallel Algorithm for Non-Monotone DR-Submodular Maximization ICML 2020 Probabilistic Fair Clustering NeurIPS 2020 Proportionality in Approval-Based Elections With a Variable Number of Winners IJCAI 2020 Rk-means: Fast Clustering for Relational Data AISTATS 2020 Robust k-means++ UAI 2020 Robust Algorithms for Online k-means Clustering ALT 2020 Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks RSS 2020 Scalable Nearest Neighbor Search for Optimal Transport ICML 2020 Selecting Voting Locations for Fun and Profit IJCAI 2020 Sets Clustering ICML 2020 Strategyproof Mechanisms for Friends and Enemies Games AAAI 2020