3 papers
cs.LG2026
A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
Philipp Baumann, Olivier Goldschmidt, Dorit S. Hochbaum +1
Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticlusters such that the objects in…
cs.DS2025
Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
Dorit S. Hochbaum, Ayleen Irribarra-Cortés, Olivier Goldschmidt +1
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial…
math.OC2025
A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem
Dorit S. Hochbaum, Philipp Baumann, Olivier Goldschmidt +1
The Quadratic Knapsack Problem (QKP) involves selecting a subset of elements that maximizes the sum of pairwise and singleton utilities without exceeding a given budget. The pairwi…