Deferred on-line bipartite matching

zbMath1457.68317MaRDI QIDQ1753111

Jakub Kozik, Grzegorz Matecki

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p24

zbMATH Keywords

adaptive algorithmonline bipartite matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Cites Work

• On-line chain partitions of orders: a survey
• On Randomized Algorithms for Matching in the Online Preemptive Model
• Improved Bounds for Online Stochastic Matching
• The Competitiveness of On-Line Assignments
• Optimal Node Routing
• Management of multi-queue switches in QoS networks

This page was built for publication: Deferred on-line bipartite matching