Approximating connected maximum cuts via local search

DOI10.4230/LIPICS.ESA.2023.93MaRDI QIDQ6657061zbMATH OpenFDO

Authors Baruch Schieber, Soroush Vahidi

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.93

zbMATH Keywords

approximation algorithmsgraph theorylocal searchmax-cut

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Competition-based two-stage evolutionary algorithm for constrained multi-objective optimization

This page was built for publication: Approximating connected maximum cuts via local search

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