Cover Image

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lee, Changyeol, Shin, Yongho, An, Hyung-Chan
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Databases Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Chromatic correlation clustering via cluster LP
by: Abbasi, Fateme, et al.
Published: (2025)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
by: Crane, Alex, et al.
Published: (2023)

Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
by: Han, Seongjune, et al.
Published: (2026)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)

Parsimonious Learning-Augmented Online Metric Matching
by: Shin, Yongho, et al.
Published: (2026)

Improved Approximation Algorithms for Relational Clustering
by: Esmailpour, Aryan, et al.
Published: (2024)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
by: Crane, Alex, et al.
Published: (2025)

Dynamic data summarization for hierarchical spatial clustering
by: Abduaziz, Kayumov, et al.
Published: (2024)

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
by: Song, Siwoo, et al.
Published: (2025)

Efficient Computation of Hyper-triangles on Hypergraphs
by: Yin, Haozhe, et al.
Published: (2025)

Matrix Product Sketching via Coordinated Sampling
by: Daliri, Majid, et al.
Published: (2025)

Learned Static Function Data Structures
by: Hermann, Stefan, et al.
Published: (2025)

Dynamic Data Layout Optimization with Worst-case Guarantees
by: Rong, Kexin, et al.
Published: (2024)

Optimal Matrix Sketching over Sliding Windows
by: Yin, Hanyan, et al.
Published: (2024)

Daisy Bloom Filters
by: Bercea, Ioana O., et al.
Published: (2022)

Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025)

Approximation Algorithms for Combinatorial Optimization with Predictions
by: Antoniadis, Antonios, et al.
Published: (2024)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
by: Liao, Meihao, et al.
Published: (2025)

Clustering with Set Outliers and Applications in Relational Clustering
by: Surianarayanan, Vaishali, et al.
Published: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2025)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
by: Shakiba, Ali
Published: (2023)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
by: Wang, Kaixin, et al.
Published: (2023)

Learning Augmented Graph $k$-Clustering
by: Fan, Chenglin, et al.
Published: (2025)

Simple KNN-Based Outlier Detection Achieves Robust Clustering
by: Jiang, Tianle, et al.
Published: (2026)

Algorithms for Optimizing Acyclic Queries
by: Luo, Zheng, et al.
Published: (2025)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
by: Mundra, Pranay, et al.
Published: (2025)

Enumeration Algorithms for Conjunctive Queries with Projection
by: Deep, Shaleen, et al.
Published: (2021)

Understanding the Cluster LP for Correlation Clustering
by: Cao, Nairen, et al.
Published: (2024)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
by: Amanatidis, Georgios, et al.
Published: (2021)

Model-Free Counterfactual Subset Selection at Scale
by: Nguyen, Minh Hieu, et al.
Published: (2025)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025)

Faster Relational Algorithms Using Geometric Data Structures
by: Esmailpour, Aryan, et al.
Published: (2026)

Motiflets -- Simple and Accurate Detection of Motifs in Time Series
by: Schäfer, Patrick, et al.
Published: (2022)

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
by: Hosseininasab, Amin, et al.
Published: (2022)

Retrieval with Learned Similarities
by: Ding, Bailu, et al.
Published: (2024)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
by: Diwan, Haya, et al.
Published: (2024)

Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)

Learning Low Degree Hypergraphs
by: Balkanski, Eric, et al.
Published: (2022)