combinatorial optimization

Minimizing a Submodular Function from Samples NeurIPS 2017 Min-Max Propagation NeurIPS 2017 Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017 Near-Optimal Design of Experiments via Regret Minimization ICML 2017 On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models JMLR 2017 Online Dynamic Programming NeurIPS 2017 On The Projection Operator to A Three-view Cardinality Constrained Set ICML 2017 Operation Frames and Clubs in Kidney Exchange IJCAI 2017 Robust Submodular Maximization: A Non-Uniform Partitioning Approach ICML 2017 Sequence to Better Sequence: Continuous Revision of Combinatorial Structures ICML 2017 Stochastic Constraint Programming IJCAI 2017 Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions ICML 2017 Subset Selection under Noise NeurIPS 2017 Which is the Fairest (Rent Division) of Them All? [Extended Abstract] IJCAI 2017 A Convex Atomic-Norm Approach to Multiple Sequence Alignment and Motif Discovery 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 Combinatorial Energy Learning for Image Segmentation NeurIPS 2016 Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016 Combinatorial Multi-Armed Bandit with General Reward Functions NeurIPS 2016 Correlation Clustering and Biclustering with Locally Bounded Errors ICML 2016 Cross-Graph Learning of Multi-Relational Associations ICML 2016 Efficient Algorithms for Adversarial Contextual Learning ICML 2016