Tight approximation for the minimum bottleneck generalized matching problem

DOI10.1007/978-3-030-58150-3_26MaRDI QIDQ2019475OpenAlexFDO

Authors Julián Mestre, N. E. Stier-Moses

Publication date 21 April 2021

Full work available at URL https://doi.org/10.1007/978-3-030-58150-3_26

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cited in

(1)

• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms

This page was built for publication: Tight approximation for the minimum bottleneck generalized matching problem

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