Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
type: Item
instance of: scholarly article
title: Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
zbMATH Open document ID: 1332.68297
author: H. F. Ting
author: Xiangzhong Xiang
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6517481
zbMATH Keywords: maximum weighted matching
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: upper bounds
zbMATH Keywords: lower bounds
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.05.032
OpenAlex ID: W561882003
cites work: Q5365114
cites work: Improved Bounds for Online Stochastic Matching
cites work: Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints
cites work: Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
cites work: Online Stochastic Matching: Beating 1-1/e
cites work: Q3579420
cites work: Online Stochastic Weighted Matching: Improved Approximation Algorithms
cites work: Online Weighted Matching
cites work: An optimal deterministic algorithm for online \(b\)-matching
cites work: Online bipartite matching with unknown distributions
cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs
cites work: Online bipartite matching with random arrivals
cites work: Online stochastic matching: online actions based on offline statistics
cites work: AdWords and generalized online matching
DOI: 10.1016/J.TCS.2015.05.032
description: scientific article; zbMATH DE number 6517481