An optimal deterministic algorithm for online b-matching

DOI10.1007/3-540-62034-6_49zbMATH Open1541.68448MaRDI QIDQ6567768FDOQ6567768

Authors: Bala Kalyanasundaram, Kirk Pruhs 

Publication date: 5 July 2024

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

Mathematics Subject Classification ID

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

Cites Work

• On-line algorithms for weighted bipartite matching and stable marriages
• Online Weighted Matching
• Online matching with blocked input
• 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)