approximation algorithm

Approximating the maximum weighted decomposable graph problem with applications to probabilistic graphical models PGM 2018 Approximation Algorithms for Cascading Prediction Models ICML 2018 Approximation algorithms for stochastic clustering NeurIPS 2018 Approximation Guarantees for Adaptive Sampling ICML 2018 A Practical Algorithm for Distributed Clustering and Outlier Detection NeurIPS 2018 Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams ICML 2018 Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems ACML 2018 Budget-feasible Procurement Mechanisms in Two-sided Markets IJCAI 2018 Clustering Algorithms for the Centralized and Local Models ALT 2018 Comparing Approximate Relaxations of Envy-Freeness IJCAI 2018 Computing Approximate Query Answers over Inconsistent Knowledge Bases IJCAI 2018 Distributed k-Clustering for Data with Heavy Noise NeurIPS 2018 Distributed Pareto Optimization for Subset Selection IJCAI 2018 Experimental Design for Cost-Aware Learning of Causal Graphs NeurIPS 2018 Exploiting Transitivity for Learning Person Re-Identification Models on a Budget CVPR 2018 Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice ICML 2018 Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions ICML 2018 Hierarchical Clustering with Structural Constraints ICML 2018 Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under ℓ_p Distances ICML 2018 Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint NeurIPS 2018 Multi-Objective Optimization Through Pareto Minimal Correction Subsets IJCAI 2018 Multiwinner Voting with Fairness Constraints IJCAI 2018 Near-Optimal Budgeted Data Exchange for Distributed Loop Closure Detection RSS 2018 Net2Text: Query-Guided Summarization of Network Forwarding Behaviors NSDI 2018 Non-monotone Submodular Maximization in Exponentially Fewer Iterations NeurIPS 2018