Secretary Matching Meets Probing with Commitment.

From MaRDI portal

Revision as of 06:06, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6090884

Jump to:navigation, search

DOI10.4230/lipics.approx/random.2021.13OpenAlexW3202345783MaRDI QIDQ6090884

Unnamed Author, Allan Borodin, Calum MacRury

Publication date: 20 November 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.13

zbMATH Keywords

online algorithms bipartite matching optimization under uncertainty stochastic probing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: Secretary Matching Meets Probing with Commitment.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6090884&oldid=35532510"