Online bottleneck matching

DOI10.1007/S10878-012-9581-9zbMath1286.90119OpenAlexW1966474040MaRDI QIDQ2436671

Christine Chung, Barbara M. Anthony

Publication date: 25 February 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

matchingonline algorithmsapproximation algorithmsresource augmentationbottleneck matching

Mathematics Subject Classification ID

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) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Online bottleneck semi-matching ⋮ Serve or skip: the power of rejection in online bottleneck matching ⋮ Online bottleneck matching on a line ⋮ Online semi-matching problem with two heterogeneous sensors in a metric space

Cites Work

• On-line algorithms for weighted bipartite matching and stable marriages
• How bad is selfish routing?
• Speed is as powerful as clairvoyance
• The Online Transportation Problem
• Online Weighted Matching
• The Online Transportation Problem: On the Exponential Boost of One Extra Server
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Online bottleneck matching