Published February 6, 2026
| Version v1
Conference paper
Open
A General Framework for Multiplets Selection: Algorithmization and Complexity Analysis
Description
In this contribution, we present the multiplets algorithm for constructing and selecting optimal sets of disjoint hyperedges across multiple groups in tabular data. We describes main computational steps and provide a complexity analysis covering both the edge construction and optimization phases, based on the Linear Sum Assignment method and the Constraint Programming SAT-based solver.
Files
07.pdf
Files
(422.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:0b8c10a3cb4a3e54debc975a8309e561
|
422.8 kB | Preview Download |
Additional details
Funding
- Ministry of Education Youth and Sports
- Research of Excellence on Digital Technologies and Wellbeing CZ.02.01.01/00/22_008/0004583