A tight quasi-polynomial bound for \textsc{Global Label Min-Cut}

DOI10.1137/1.9781611977554.CH12MaRDI QIDQ6538538zbMATH OpenFDO

Authors Lars Jaffke, Paloma T. Lima, Tomáš Masařík, Marcin Pilipczuk, Uéverton S. Souza

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977554.CH12

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Solving the minimum labeling global cut problem by mathematical programming
• Shortest cycles with monotone submodular costs
• Can you link up with treewidth?
• Hedgegraph polymatroids

This page was built for publication: A tight quasi-polynomial bound for \textsc{Global Label Min-Cut}

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538538)