Catch them if you can

DOI10.1145/2422436.2422489zbMath1362.68296MaRDI QIDQ2986895

Marek Cygan, Piotr Sankowski, Marcin Mucha, Anupam Gupta, Matthias Englert

Publication date: 16 May 2017

Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2422436.2422489

zbMATH Keywords

online algorithms; stochastic models; bipartite matching; impatience

Mathematics Subject Classification ID

90C15: Stochastic programming

90B22: Queues and service in operations research

90C27: Combinatorial optimization

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68W27: Online algorithms; streaming algorithms