25 citations · 119 across the 29 of their papers we have counts for
Showing 2026 · cs.DSShow all
3 papers · 2 filters
cs.DS2026
Graph Partitioning with Demands: Generalized Conductance and its Applications
Michał Szyfelbein, Dariusz Dereniowski
We study various graph partitioning tasks subject to general demands. In Graph Partitioning with Demands (GPD), the goal is to delete minimum cost supply edge set so that each rema…
cs.DS2026
Hierarchical -Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs
Michał Szyfelbein, Dariusz Dereniowski
Consider the following variation on the Hierarchical Clustering problem: Usually, while building a hierarchical clustering, one recursively partitions the data until each cluster b…
cs.DS2026
Precedence-Constrained Decision Trees and Coverings
Michał Szyfelbein, Dariusz Dereniowski
This work considers a number of optimization problems and reductive relations between them. The two main problems we are interested in are the Optimal Decision Tree and Set Cover.…