Call admission problems on trees

DOI10.1016/j.tcs.2022.04.042OpenAlexW4229460063MaRDI QIDQ2672603

Hans-Joachim Böckenhauer, Nina Corvelo Benz, Dennis Komm

Publication date: 13 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.042

zbMATH Keywords

competitive analysisadvice complexitydisjoint path allocationcall admission

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Online interval scheduling with predictions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms with advice: the tape model
• The string guessing problem as a method to prove lower bounds on the advice complexity
• The advice complexity of a class of hard online problems
• Call admission problems on grids with advice (extended abstract)
• Call admission problems on trees with advice (extended abstract)
• On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
• A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey
• On the Power of Randomness versus Advice in Online Computation
• Disjoint Path Allocation with Sublinear Advice
• Information Complexity of Online Problems
• Extremal Problems for Topological Indices in Combinatorial Chemistry
• On Recursions Connected With Symmetric Groups I
• Length-Weighted Disjoint Path Allocation

This page was built for publication: Call admission problems on trees