Online request server matching

DOI10.1016/S0304-3975(00)00265-6MaRDI QIDQ5958719zbMATH OpenFDO

Authors M. Riedel

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00265-6

zbMATH Keywords

competitive analysisonline bipartite matchingonline scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Deferred on-line bipartite matching
• Online total bipartite matching problem
• Online Weighted Matching
• scientific article; zbMATH DE number 7236471
• A randomized O(^2k)-competitive algorithm for metric bipartite matching

Cites work

• Approximation algorithms for NP-hard problems.
• Foundations of computer science. Potential, theory, cognition
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Online algorithms. The state of the art
• Paths, Trees, and Flowers

Cited in

(3)

• Serve or skip: the power of rejection in online bottleneck matching
• Optimal matching of approvers to access requests
• Robust online speed scaling with deadline uncertainty

This page was built for publication: Online request server matching

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