Call admission problems on grids with advice
From MaRDI portal
Publication:2136274
DOI10.1016/J.TCS.2022.03.022OpenAlexW4220702923MaRDI QIDQ2136274FDOQ2136274
Dennis Komm, Raphael Wegner, Hans-Joachim Böckenhauer
Publication date: 10 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.022
Recommendations
Cites Work
- The on-line encyclopedia of integer sequences
- Title not available (Why is that?)
- Online Primal-Dual Algorithms for Covering and Packing
- Information Complexity of Online Problems
- On the Advice Complexity of Online Problems
- Online computation with advice
- A simplified Binet formula for k-generalized Fibonacci numbers
- Title not available (Why is that?)
- How Much Information about the Future Is Needed?
- On the advice complexity of the \(k\)-server problem under sparse metrics
- The string guessing problem as a method to prove lower bounds on the advice complexity
- On the advice complexity of the \(k\)-server problem
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
- Disjoint Path Allocation with Sublinear Advice
- Online algorithms with advice: the tape model
- The advice complexity of a class of hard online problems
- Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
- Call admission problems on grids with advice (extended abstract)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Call admission problems on grids with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136274)
