approximation algorithm

Minimizing Time-to-Rank: A Learning and Recommendation Approach IJCAI 2019 Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract) IJCAI 2019 On Euclidean k-Means Clustering with alpha-Center Proximity AISTATS 2019 Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NeurIPS 2019 Online Pandora’s Boxes and Bandits AAAI 2019 On the Efficiency and Equilibria of Rich Ads IJCAI 2019 On the Hardness of Probabilistic Inference Relaxations AAAI 2019 Optimal Decision Tree with Noisy Outcomes NeurIPS 2019 Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems IJCAI 2019 Pareto Optimization for Subset Selection with Dynamic Cost Constraints AAAI 2019 Preferred Deals in General Environments IJCAI 2019 Randomized Strategies for Robust Combinatorial Optimization AAAI 2019 Recommending Links to Maximize the Influence in Social Networks IJCAI 2019 Sliding Window Temporal Graph Coloring AAAI 2019 Strategyproof and Approximately Maxmin Fair Share Allocation of Chores IJCAI 2019 Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019 Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications ICML 2019 Submodular Optimization over Streams with Inhomogeneous Decays AAAI 2019 Subquadratic High-Dimensional Hierarchical Clustering NeurIPS 2019 Testing Symmetric Markov Chains Without Hitting COLT 2019 Time/Accuracy Tradeoffs for Learning a ReLU with respect to Gaussian Marginals NeurIPS 2019 Towards a Zero-One Law for Column Subset Selection NeurIPS 2019 Towards Efficient Data Valuation Based on the Shapley Value AISTATS 2019 Weighted Maxmin Fair Share Allocation of Indivisible Chores IJCAI 2019 Algorithms for the Nearest Assignment Problem IJCAI 2018