approximation algorithm

Correlation clustering with local objectives NeurIPS 2019 Coverage Centrality Maximization in Undirected Networks AAAI 2019 Decentralized Gradient Tracking for Continuous DR-Submodular Maximization AISTATS 2019 Defending Elections against Malicious Spread of Misinformation AAAI 2019 Dimensionality reduction: theoretical perspective on practical measures NeurIPS 2019 Distributed Weighted Matching via Randomized Composable Coresets ICML 2019 Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines AAAI 2019 Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm AAAI 2019 Equitable Stable Matchings in Quadratic Time NeurIPS 2019 Exploiting Social Influence to Control Elections Based on Scoring Rules IJCAI 2019 Facility Location Problem in Differential Privacy Model Revisited NeurIPS 2019 Fair k-Center Clustering for Data Summarization ICML 2019 Faster Algorithms for Binary Matrix Factorization ICML 2019 Faster width-dependent algorithm for mixed packing and covering LPs NeurIPS 2019 Finding All Bayesian Network Structures within a Factor of Optimal AAAI 2019 Fully Dynamic Consistent Facility Location NeurIPS 2019 Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints AAAI 2019 Hierarchical Clustering for Euclidean Data AISTATS 2019 Hiring Under Uncertainty ICML 2019 How Similar Are Two Elections? AAAI 2019 Improving Nash Social Welfare Approximations IJCAI 2019 k-Means Clustering of Lines for Big Data NeurIPS 2019 Matroids, Matchings, and Fairness AISTATS 2019 Maximin-Aware Allocations of Indivisible Goods IJCAI 2019 Measuring the Likelihood of Numerical Constraints IJCAI 2019