Online bottleneck matching

DOI10.1007/978-3-642-31770-5_23MaRDI QIDQ3167367zbMATH OpenOpenAlexFDO

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

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)

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(^2k)-competitive algorithm for metric bipartite matching

Cited in

(6)

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

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)