Combinatorial Optimization

Which is the Fairest (Rent Division) of Them All? [Extended Abstract] IJCAI 2017 A Box-Constrained Approach for Hard Permutation Problems ICML 2016 A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NeurIPS 2016 Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint NeurIPS 2016 Algorithms for Optimizing the Ratio of Submodular Functions ICML 2016 An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016 A Simple and Strongly-Local Flow-Based Method for Cut Improvement ICML 2016 Assortment Optimization Under the Mallows model NeurIPS 2016 Bipartite Correlation Clustering: Maximizing Agreements AISTATS 2016 Boolean Matrix Factorization and Noisy Completion via Message Passing ICML 2016 Causal meets Submodular: Subset Selection with Directed Information NeurIPS 2016 Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016 Computing and maximizing influence in linear threshold and triggering models NeurIPS 2016 Controlling the distance to a Kemeny consensus without computing it ICML 2016 Correlation Clustering and Biclustering with Locally Bounded Errors ICML 2016 Distributed Submodular Maximization JMLR 2016 Efficient Globally Optimal 2D-To-3D Deformable Shape Matching CVPR 2016 Exploiting Tradeoffs for Exact Recovery in Heterogeneous Stochastic Block Models NeurIPS 2016 Fast Constrained Submodular Maximization: Personalized Data Summarization ICML 2016 Fast Distributed Submodular Cover: Public-Private Data Summarization NeurIPS 2016 Feature-distributed sparse regression: a screen-and-clean approach NeurIPS 2016 GIFT: A Real-Time and Scalable 3D Shape Search Engine CVPR 2016 Greedy Column Subset Selection: New Bounds and Distributed Algorithms ICML 2016 Guaranteed Outlier Removal With Mixed Integer Linear Programs CVPR 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016