Petr Kolman

collaborators

4 papers

cs.DS2026

Approximation of Spanning Tree Congestion using Hereditary Bisection

Petr Kolman

The Spanning Tree Congestion (STC) problem is the following NP-hard problem: given a graph $G$ , construct a spanning tree $T$ of $G$ minimizing its maximum edge congestion where th…

cs.DS2026

Min-Max Connected Multiway Cut

Hans Raj Tiwary, Petr Kolman

We introduce a variant of the multiway cut that we call the min-max connected multiway cut. Given a graph $G = (V, E)$ and a set $I^ \subseteq V$ of $t$ terminals, partition $V$ into $…

math.CO2026

Bond Polytope under Vertex- and Edge-sums

Petr Kolman, Hans Raj Tiwary

A cut in a graph $G$ is called a {\em bond} if both parts of the cut induce connected subgraphs in $G$ , and the {\em bond polytope} is the convex hull of all bonds. Computing the m…

cs.DS2026

Two Complexity Results on Spanning-Tree Congestion Problems

Sunny Atalig, Marek Chrobak, Christoph DÃ¼rr +4

In the spanning-tree congestion problem ( $STC$ ), we are given a graph $G$ , and the objective is to compute a spanning tree of $G$ that minimizes the maximum edge congestio…