Online request server matching

DOI10.1016/S0304-3975(00)00265-6zbMath0992.68012MaRDI QIDQ5958719

No author found.

Publication date: 3 March 2002

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

zbMATH Keywords

competitive analysisonline bipartite matchingonline scheduling

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Online algorithms. The state of the art
• Foundations of computer science. Potential, theory, cognition
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item

This page was built for publication: Online request server matching