Daniel P. Szabo

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

${s, t}$ -Separating Principal Partition Sequence of Submodular Functions

KristÃ³f BÃ©rczi, Karthekeyan Chandrasekaran, TamÃ¡s KirÃ¡ly +1

Narayanan showed the existence of the principal partition sequence of a submodular function, a structure with numerous applications in areas such as clustering, fast algorithms, an…

cs.DS2025

Approximating Submodular Matroid-Constrained Partitioning

KristÃ³f BÃ©rczi, Karthekeyan Chandrasekaran, TamÃ¡s KirÃ¡ly +1

The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$ , the sum of a given submodular function $f$ over the parts of $P$ . The problem has…

cs.DS2024

Multiway Cuts with a Choice of Representatives

In this paper, we study several generalizations of multiway cut where the terminals can be chosen as \emph{representatives} from sets of \emph{candidates} $T_{1}, \dots, T_{q}$ . In this…

{s,t}-Separating Principal Partition Sequence of Submodular Functions

Approximating Submodular Matroid-Constrained Partitioning

Multiway Cuts with a Choice of Representatives

${s, t}$ -Separating Principal Partition Sequence of Submodular Functions