conftrace_

approximation algorithm

630 papers

Explore in graph

Also known as

APPROX

Co-occurring keywords

combinatorial optimization (1039) submodular maximization (143) submodular optimization (261) k-means clustering (235) greedy algorithm (242) mechanism design (340) fair division (158) submodular function (121) hierarchical clustering (232) graph algorithm (178)

Papers

Equitable Scheduling on a Single Machine AAAI 2021
Defending against Contagious Attacks on a Network with Resource Reallocation AAAI 2021
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021
Enhancing Balanced Graph Edge Partition with Effective Local Search AAAI 2021
Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021
Objective-Based Hierarchical Clustering of Deep Embedding Vectors AAAI 2021
Differentially Private k-Means via Exponential Mechanism and Max Cover AAAI 2021
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee AAAI 2021
Nyströmformer: A Nyström-based Algorithm for Approximating Self-Attention AAAI 2021
Fair Scheduling for Time-dependent Resources NIPS 2021
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NIPS 2021
Targeted Negative Campaigning: Complexity and Approximations AAAI 2021
Budget-feasible Maximum Nash Social Welfare is Almost Envy-free IJCAI 2021
Budget-feasible Mechanisms for Representing Groups of Agents Proportionally IJCAI 2021
Intervention Efficient Algorithms for Approximate Learning of Causal Graphs ALT 2021
No-substitution k-means Clustering with Adversarial Order ALT 2021
Unexpected Effects of Online no-Substitution $k$-means Clustering ALT 2021
Adaptivity in Adaptive Submodularity COLT 2021
Approximation Algorithms for Socially Fair Clustering COLT 2021
Approximation Algorithms for Orthogonal Non-negative Matrix Factorization AISTATS 2021
Gradient Method for Continuous Influence Maximization with Budget-Saving Considerations AAAI 2020
Optimal Common Contract with Heterogeneous Agents AAAI 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NIPS 2020
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics NIPS 2020
Adaptive Probing Policies for Shortest Path Routing NIPS 2020