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

Differentially Private Densest Subgraph Detection ICML 2021
Participatory Budgeting with Project Groups IJCAI 2021
Stochastic Probing with Increasing Precision IJCAI 2021
Guaranteeing Maximin Shares: Some Agents Left Behind IJCAI 2021
Provably Approximated Point Cloud Registration ICCV 2021
Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem INTERSPEECH 2021
Extreme k-Center Clustering AAAI 2021
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings AAAI 2021
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints AAAI 2021
Fairness in Influence Maximization through Randomization AAAI 2021
Efficient Truthful Scheduling and Resource Allocation through Monitoring AAAI 2021
Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs NIPS 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NIPS 2021
Coresets for Decision Trees of Signals NIPS 2021
Fair Clustering Under a Bounded Cost NIPS 2021
Parallel and Efficient Hierarchical k-Median Clustering NIPS 2021
Constrained Robust Submodular Partitioning NIPS 2021
Greedy Approximation Algorithms for Active Sequential Hypothesis Testing NIPS 2021
Dynamic influence maximization NIPS 2021
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NIPS 2021
Near-Optimal Multi-Perturbation Experimental Design for Causal Structure Learning NIPS 2021
Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization AAAI 2021
Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs) AAAI 2021
Maximin Fairness with Mixed Divisible and Indivisible Goods AAAI 2021
Minimum Robust Multi-Submodular Cover for Fairness AAAI 2021