Online perfect matching and mobile computing

DOI10.1007/3-540-60220-8_62MaRDI QIDQ5057433zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1256657 (Why is no real title available?)
• scientific article; zbMATH DE number 742966 (Why is no real title available?)
• Online load balancing of temporary tasks
• Random walks on weighted graphs and applications to on-line algorithms

Cited in

(13)

• Tight bounds for online matching in bounded-degree graphs with vertex capacities
• scientific article; zbMATH DE number 7758339 (Why is no real title available?)
• Online metric matching on the line with recourse
• Shortest augmenting paths for online matchings on trees
• Optimal algorithms for online b-matching with variable vertex capacities
• Fully-dynamic load balancing
• A generalized matching reconfiguration problem
• Fully-dynamic load balancing
• Local base station assignment with time intervals in mobile computing environments
• Low recourse arborescence forests under uniformly random arcs
• Interval-constrained bipartite matching over time
• Simple (invited talk)
• scientific article; zbMATH DE number 7561575 (Why is no real title available?)

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)