Image de couverture de livre

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Baumann, Philipp, Goldschmidt, Olivier, Hochbaum, Dorit S., Yang, Jason
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem
par: Hochbaum, Dorit S., et autres
Publié: (2024)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
par: Xue, Jinghui, et autres
Publié: (2024)

An algorithm for clustering with confidence-based must-link and cannot-link constraints
par: Baumann, Philipp, et autres
Publié: (2022)

HYGENE: A Diffusion-based Hypergraph Generation Method
par: Gailhard, Dorian, et autres
Publié: (2024)

Frustrated Random Walks: A Fast Method to Compute Node Distances on Hypergraphs
par: Li, Enzhi, et autres
Publié: (2024)

Graph-Based Semi-Supervised Segregated Lipschitz Learning
par: Bozorgnia, Farid, et autres
Publié: (2024)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
par: Bressan, Marco, et autres
Publié: (2025)

HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs
par: Xu, Ning, et autres
Publié: (2025)

Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors
par: Choi, Heejin, et autres
Publié: (2024)

A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility
par: Batool, Muniba, et autres
Publié: (2024)

Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
par: Zhou, Junru, et autres
Publié: (2024)

GraphOmni: A Comprehensive and Extensible Benchmark Framework for Large Language Models on Graph-theoretic Tasks
par: Xu, Hao, et autres
Publié: (2025)

Online Algorithm for Node Feature Forecasting in Temporal Graphs
par: Rahman, Aniq Ur, et autres
Publié: (2024)

Algorithm for Interpretable Graph Features via Motivic Persistent Cohomology
par: Maruyama, Yoshihiro
Publié: (2025)

Top-K Exterior Power Persistent Homology: Algorithm, Structure, and Stability
par: Maruyama, Yoshihiro
Publié: (2025)

An Effective Flow-based Method for Positive-Unlabeled Learning: 2-HNC
par: Hochbaum, Dorit, et autres
Publié: (2025)

Contradiction Graphs Determine VC Dimension
par: Campbell, Jesse, et autres
Publié: (2026)

Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis
par: Dabah, Adel
Publié: (2026)

Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
par: Shafi, Zohair, et autres
Publié: (2023)

Deep Learning for Unrelated-Machines Scheduling: Handling Variable Dimensions
par: Hitzges, Diego, et autres
Publié: (2025)

Sample compression schemes for balls in graphs
par: Chalopin, Jérémie, et autres
Publié: (2022)

Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
par: Gailhard, Dorian, et autres
Publié: (2025)

MILP-StuDio: MILP Instance Generation via Block Structure Decomposition
par: Liu, Haoyang, et autres
Publié: (2024)

Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies
par: Weitzman, Shlomi, et autres
Publié: (2024)

Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
par: Cömer, Can, et autres
Publié: (2025)

Isolation Forest in Novelty Detection Scenario
par: Ulrich, Adam, et autres
Publié: (2025)

On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
par: Pluska, Alexander, et autres
Publié: (2025)

Partial Optimality in Cubic Correlation Clustering for General Graphs
par: Stein, David, et autres
Publié: (2025)

Differentiable Quadratic Optimization For The Maximum Independent Set Problem
par: Alkhouri, Ismail, et autres
Publié: (2024)

On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth
par: Averkov, Gennadiy, et autres
Publié: (2025)

Designing ReLU Generative Networks to Enumerate Trees with a Given Tree Edit Distance
par: Ghafoor, Mamoona, et autres
Publié: (2025)

UniCO: Towards a Unified Model for Combinatorial Optimization Problems
par: Zong, Zefang, et autres
Publié: (2025)

Extended Deep Submodular Functions
par: Hosseini, Seyed Mohammad, et autres
Publié: (2024)

Graphon Mixtures
par: Kandanaarachchi, Sevvandi, et autres
Publié: (2025)

Box Facets and Cut Facets of Lifted Multicut Polytopes
par: Naumann, Lucas Fabian, et autres
Publié: (2024)

Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums
par: Ohnishi, Motoya, et autres
Publié: (2022)

Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
par: Wu, Yikai, et autres
Publié: (2025)

Graph Inference with Effective Resistance Queries
par: Bennett, Huck, et autres
Publié: (2025)

The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
par: Prunet, Thibault, et autres
Publié: (2024)

A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
par: Ta, Hoang, et autres
Publié: (2025)