Engineering fast algorithms for the bottleneck matching problem

DOI10.4230/LIPICS.ESA.2023.87MaRDI QIDQ6657052zbMATH OpenFDO

Authors Ioannis Panagiotas, Gregoire Pichon, Bora Uçar

Publication date 6 January 2025

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

zbMATH Keywords

assignment problembipartite graphsmatching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Algorithms for symmetric Birkhoff-von Neumann decomposition of symmetric doubly stochastic matrices

This page was built for publication: Engineering fast algorithms for the bottleneck matching problem

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