Call admission problems on grids with advice

DOI10.1016/J.TCS.2022.03.022MaRDI QIDQ2136274zbMATH OpenOpenAlexFDO

Authors Hans-Joachim Böckenhauer, Dennis Komm, Raphael Wegner

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

zbMATH Keywords

competitive analysisadvice complexitydisjoint path allocationcall admission

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Call admission problems on grids with advice (extended abstract)
• Advice complexity for a class of online problems
• How Much Information about the Future Is Needed?
• On the Advice Complexity of Online Problems
• Measuring the problem-relevant information in input

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1261807 (Why is no real title available?)
• scientific article; zbMATH DE number 6865614 (Why is no real title available?)
• A simplified Binet formula for \(k\)-generalized Fibonacci numbers
• Call admission problems on grids with advice (extended abstract)
• Disjoint path allocation with sublinear advice
• How Much Information about the Future Is Needed?
• Information complexity of online problems
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• On the Advice Complexity of Online Problems
• On the advice complexity of the \(k\)-server problem
• On the advice complexity of the \(k\)-server problem under sparse metrics
• On the power of advice and randomization for the disjoint path allocation problem
• Online algorithms with advice: the tape model
• Online computation with advice
• Online primal-dual algorithms for covering and packing
• The advice complexity of a class of hard online problems
• The on-line encyclopedia of integer sequences
• The string guessing problem as a method to prove lower bounds on the advice complexity

Cited in

(4)

• Call admission problems on grids with advice (extended abstract)
• Online interval scheduling with predictions
• Priority algorithms with advice for disjoint path allocation problems
• Call admission problems on trees

Describes a project that uses

Uses Software

• OEIS

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)