Skip to content
conftrace_

approximation algorithm

676 papers

APPROX

Papers

Online and Consistent Correlation Clustering ICML 2022 Online Approval Committee Elections IJCAI 2022 Online Matching with Controllable Rewards and Arrival Probabilities IJCAI 2022 On the Complexity of Approximating Multimarginal Optimal Transport JMLR 2022 Parameterized Approximation Algorithms for K-center Clustering and Variants AAAI 2022 Pizza Sharing Is PPA-Hard AAAI 2022 Placing Green Bridges Optimally, with Habitats Inducing Cycles IJCAI 2022 Planning with Participation Constraints AAAI 2022 Posted Pricing and Dynamic Prior-independent Mechanisms with Value Maximizers NeurIPS 2022 Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering ICML 2022 Provable Sensor Sets for Epidemic Detection over Networks with Minimum Delay AAAI 2022 Recruitment Strategies That Take a Chance NeurIPS 2022 Robustness in Multi-Objective Submodular Optimization: a Quantile Approach ICML 2022 RUMs from Head-to-Head Contests ICML 2022 Scheduling with Untrusted Predictions IJCAI 2022 Secretary Matching with Vertex Arrivals and No Rejections AAAI 2022 Sketch-and-lift: scalable subsampled semidefinite program for K-means clustering AISTATS 2022 Sketching as a Tool for Understanding and Accelerating Self-attention for Long Sequences NAACL 2022 Social Aware Assignment of Passengers in Ridesharing (Student Abstract) AAAI 2022 Sparsification of Decomposable Submodular Functions AAAI 2022 Strategyproof Mechanisms for Group-Fair Facility Location Problems IJCAI 2022 Submodular Maximization in Clean Linear Time NeurIPS 2022 Subset Approximation of Pareto Regions with Bi-objective A* AAAI 2022 The Complexity of Subelection Isomorphism Problems AAAI 2022 The Complexity of Temporal Vertex Cover in Small-Degree Graphs AAAI 2022