Shortest cycles with monotone submodular costs

DOI10.1137/1.9781611977554.CH83MaRDI QIDQ6538616zbMATH OpenFDO

Authors Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis

Publication date 14 May 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• scientific article; zbMATH DE number 1303553
• Minimizing symmetric submodular functions
• Subquadratic submodular function minimization
• A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION

Cited in

(2)

• Computing paths of large rank in planar frameworks deterministically
• Computing paths of large rank in planar frameworks deterministically

This page was built for publication: Shortest cycles with monotone submodular costs

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