An optimal deterministic algorithm for online b-matching

DOI10.1007/3-540-62034-6_49MaRDI QIDQ6567768zbMATH OpenFDO

Authors Bala Kalyanasundaram, Kirk Pruhs

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-62034-6_49

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• An optimal deterministic algorithm for online \(b\)-matching
• Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
• Near optimal algorithms for online maximum weighted b-matching
• Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching

Cites work

• On-line algorithms for weighted bipartite matching and stable marriages
• Online matching with blocked input
• Online Weighted Matching
• The online transportation problem

Cited in

(1)

• Optimal Algorithms for Online b-Matching with Variable Vertex Capacities

This page was built for publication: An optimal deterministic algorithm for online b-matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567768)