Online perfect matching and mobile computing

DOI10.1007/3-540-60220-8_62zbMATH Open1502.68376OpenAlexW1501694180MaRDI QIDQ5057433FDOQ5057433

Authors:

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60220-8_62

Recommendations

• Online matching: haste makes waste!
• Online Weighted Matching
• Approximation and Online Algorithms
• A randomized algorithm for the on-line weighted bipartite matching problem
• An optimal deterministic algorithm for online \(b\)-matching

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Queues and service in operations research (90B22)

Cites Work

• Random walks on weighted graphs and applications to on-line algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Online load balancing of temporary tasks

Cited In (4)

• Title not available (Why is that?)
• Shortest augmenting paths for online matchings on trees
• Local base station assignment with time intervals in mobile computing environments
• Title not available (Why is that?)

This page was built for publication: Online perfect matching and mobile computing

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