Michael Zlatin

activity

20182026

d

-complete posets: towards the

K

-theory of Kac-Moody flag varieties

2 citations · 2 across the 10 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022

Approximation algorithms for Steiner Tree Augmentation Problems

R. Ravi, Weizhong Zhang, Michael Zlatin

In the Steiner Tree Augmentation Problem (STAP), we are given a graph $G = (V, E)$ , a set of terminals $R \subseteq V$ , and a Steiner tree $T$ spanning $R$ . The edges $L := E \setmi…

math.CO2022

On packing dijoins in digraphs and weighted digraphs

Ahmad Abdi, Gérard Cornuéjols, Michael Zlatin

Let $D = (V, A)$ be a digraph. A dicut is a cut $δ^{+} (U) \subseteq A$ for some nonempty proper vertex subset $U$ such that $δ^{-} (U) = \emptyset$ , a dijoin is an arc subset that intersects…