ICML 2024 "approximation algorithms" Papers
11 papers found
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi et al.
ICML 2024poster
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
Vincent Cohen-Addad, Tommaso d'Orsi, Aida Mousavifar
ICML 2024poster
Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani
ICML 2024poster
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao et al.
ICML 2024poster
Consistent Submodular Maximization
PAUL DUETTING, Federico Fusco, Silvio Lattanzi et al.
ICML 2024poster
Dynamic Correlation Clustering in Sublinear Update Time
Vincent Cohen-Addad, Silvio Lattanzi, Andreas Maggiori et al.
ICML 2024spotlight
Dynamic Facility Location in High Dimensional Euclidean Spaces
Sayan Bhattacharya, Gramoz Goranci, Shaofeng Jiang et al.
ICML 2024spotlight
Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs
Slobodan Mitrovic, Theodore Pan
ICML 2024poster
Near-Linear Time Approximation Algorithms for k-means with Outliers
Junyu Huang, Qilong Feng, Ziyun Huang et al.
ICML 2024poster
Optimally Improving Cooperative Learning in a Social Setting
Shahrzad Haddadan, Cheng Xin, Jie Gao
ICML 2024poster
Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
ICML 2024poster