Online bottleneck matching

DOI10.1007/978-3-642-31770-5_23zbMATH Open1301.90076OpenAlexW3157024292MaRDI QIDQ3167367FDOQ3167367

Authors: Barbara M. Anthony, Christine Chung 

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.conncoll.edu/comscifacpub/10

Recommendations

• Online bottleneck matching
• The Power of Rejection in Online Bottleneck Matching
• Serve or skip: the power of rejection in online bottleneck matching
• Competitive analysis for two variants of online metric matching problem
• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80)

Cited In (6)

• Online bottleneck matching
• Online matching with blocked input
• The Power of Rejection in Online Bottleneck Matching
• Online bottleneck matching on a line
• Serve or skip: the power of rejection in online bottleneck matching
• Improved online algorithms for jumbled matching

This page was built for publication: Online bottleneck matching

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