Co-occurring keywords · papers mentioning both
Papers
NuMDS: An Efficient Local Search Algorithm for Minimum Dominating Set Problem
IJCAI 2025
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
AAAI 2025
A Scalable Algorithm for Individually Fair k-Means Clustering
AISTATS 2024
Linear Time Approximation Algorithm for Column Subset Selection with Local Search
NeurIPS 2024
ParaILP: A Parallel Local Search Framework for Integer Linear Programming with Cooperative Evolution Mechanism
IJCAI 2024
Scalable Algorithms for Individual Preference Stable Clustering
AISTATS 2024
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search
JMLR 2023
A Fast Local Search Algorithm for the Latin Square Completion Problem
AAAI 2022
FLS: A New Local Search Algorithm for K-means with Smaller Search Space
IJCAI 2022
From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization
COLT 2022
Local Search Algorithms for Rank-Constrained Convex Optimization
ICLR 2021
Local Search for Diversified Top-k s-plex Search Problem (Student Abstract)
AAAI 2021
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
ICML 2020
Individual Fairness for k-Clustering
ICML 2020
Reduction and Local Search for Weighted Graph Coloring Problem
AAAI 2020
On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows
IJCAI 2019
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization
ICML 2016