Online bottleneck semi-matching

DOI10.1007/978-3-030-92681-6_35OpenAlexW4206063149MaRDI QIDQ2150569

Weidong Li, Man Xiao, Shu Zhao, Jin-Hua Yang

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_35

zbMATH Keywords

competitive ratioonline algorithmcapacity limitsonline bottleneck matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Online bottleneck matching on a line ⋮ The bound coverage problem by aligned disks in \(L_1\) metric ⋮ Online semi-matching problem with two heterogeneous sensors in a metric space

Cites Work

• Unnamed Item
• Unnamed Item
• Serve or skip: the power of rejection in online bottleneck matching
• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
• Online matching on a line
• A \(o(n)\)-competitive deterministic algorithm for online matching on a line
• Online bottleneck matching
• The Online Metric Matching Problem for Doubling Metrics
• The Online Transportation Problem
• A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
• Competitive analysis for two variants of online metric matching problem
• Online facility assignment

This page was built for publication: Online bottleneck semi-matching