Co-occurring keywords · papers mentioning both
Papers
Streaming Submodular Maximization under a k-Set System Constraint
ICML 2020
Submodular Maximization Through Barrier Functions
NeurIPS 2020
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation
NeurIPS 2020
Tight Approximation for Proportional Approval Voting
IJCAI 2020
Uniform Welfare Guarantees Under Identical Subadditive Valuations
IJCAI 2020
Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources
AAAI 2020
A 2-Approximation Algorithm for the Online Tethered Coverage Problem
RSS 2019
A Bridge between Liquid and Social Welfare in Combinatorial Auctions with Submodular Bidders
AAAI 2019
Adaptive Influence Maximization with Myopic Feedback
NeurIPS 2019
A Graph Theoretic Additive Approximation of Optimal Transport
NeurIPS 2019
Algorithms for Average Regret Minimization
AAAI 2019
A near-optimal algorithm for approximating the John Ellipsoid
COLT 2019
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
IJCAI 2019
Approximately Maximizing the Broker's Profit in a Two-sided Market
IJCAI 2019
Approximate Profile Maximum Likelihood
JMLR 2019
Approximating Integer Solution Counting via Space Quantification for Linear Constraints
IJCAI 2019
Approximating the Permanent by Sampling from Adaptive Partitions
NeurIPS 2019
Approximation Algorithms for Stochastic Clustering
JMLR 2019
Approximation and Hardness of Shift-Bribery
AAAI 2019
Approximation Hardness for A Class of Sparse Optimization Problems
JMLR 2019
Approximation Ratios of Graph Neural Networks for Combinatorial Problems
NeurIPS 2019
A Quantitative Analysis of Multi-Winner Rules
IJCAI 2019
A Unified Approach to Online Matching with Conflict-Aware Constraints
AAAI 2019
Combinatorial Algorithms for Optimal Design
COLT 2019
Conditional Sparse L_p-norm Regression With Optimal Probability
AISTATS 2019