Serve or skip: the power of rejection in online bottleneck matching
type: Item
instance of: scholarly article
title: Serve or skip: the power of rejection in online bottleneck matching
zbMATH Open document ID: 1356.90115
author: Barbara M. Anthony
author: Christine Chung
published in: Journal of Combinatorial Optimization
publication date: 2016-11-29T00:00:00Z
full work available at URL: https://digitalcommons.conncoll.edu/comscifacpub/30
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6657324
zbMATH Keywords: online algorithms
zbMATH Keywords: bottleneck matching
zbMATH Keywords: resource augmentation
zbMATH Keywords: approximation algorithms
zbMATH Keywords: matching
MaRDI profile type: Publication
OpenAlex ID: W1438989008
cites work: Online bottleneck matching
cites work: The Online Transportation Problem: On the Exponential Boost of One Extra Server
cites work: An optimal deterministic algorithm for online \(b\)-matching
cites work: Second-price ad auctions with binary bids and markets with good competition
cites work: Online matching on a line
cites work: Algorithms for two bottleneck optimization problems
cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
cites work: Q3579420
cites work: Competitive auctions and digital goods
cites work: The power of deferral
cites work: Maintaining Assignments Online: Matching, Scheduling, and Flows
cites work: How bad is selfish routing?
cites work: Online Weighted Matching
cites work: Speed is as powerful as clairvoyance
cites work: The Online Transportation Problem
cites work: On-line algorithms for weighted bipartite matching and stable marriages
cites work: The Power of Recourse for Online MST and TSP
cites work: AdWords and generalized online matching
cites work: Optimal time-critical scheduling via resource augmentation
DOI: 10.1007/S10878-015-9948-9
description: scientific article; zbMATH DE number 6657324