Shortest cycles with monotone submodular costs

DOI10.1137/1.9781611977554.CH83MaRDI QIDQ6538616

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

Publication date: 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

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)