Serve or skip: the power of rejection in online bottleneck matching

DOI10.1007/s10878-015-9948-9zbMath1356.90115OpenAlexW1438989008MaRDI QIDQ346521

Christine Chung, Barbara M. Anthony

Publication date: 29 November 2016

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

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

zbMATH Keywords

matchingonline algorithmsapproximation algorithmsresource augmentationbottleneck matching

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Online bottleneck semi-matching ⋮ Online bottleneck matching on a line

Cites Work

• Unnamed Item
• Unnamed Item
• On-line algorithms for weighted bipartite matching and stable marriages
• An optimal deterministic algorithm for online \(b\)-matching
• Online matching on a line
• Online bottleneck matching
• Second-price ad auctions with binary bids and markets with good competition
• How bad is selfish routing?
• AdWords and generalized online matching
• Algorithms for two bottleneck optimization problems
• Speed is as powerful as clairvoyance
• The Online Transportation Problem
• Online Weighted Matching
• Maintaining Assignments Online: Matching, Scheduling, and Flows
• The Online Transportation Problem: On the Exponential Boost of One Extra Server
• The power of deferral
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• The Power of Recourse for Online MST and TSP
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: Serve or skip: the power of rejection in online bottleneck matching