Max-min greedy matching problem: hardness for the adversary and fractional variant

From MaRDI portal
Publication:6138832












This page was built for publication: Max-min greedy matching problem: hardness for the adversary and fractional variant

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