Call admission problems on grids with advice (extended abstract)

DOI10.1007/978-3-030-04693-4_8MaRDI QIDQ1757763zbMATH OpenOpenAlexFDO

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

Publication date 15 January 2019

Full work available at URL https://doi.org/10.1007/978-3-030-04693-4_8

zbMATH Keywords

competitive analysisadvice complexitydisjoint path allocationcall admission

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Recommendations

• Call admission problems on grids with advice
• Advice complexity for a class of online problems
• How Much Information about the Future Is Needed?
• On the Advice Complexity of Online Problems
• Advice complexity of disjoint path allocation

Cited in

(3)

• On the advice complexity of the online dominating set problem
• Call admission problems on grids with advice
• Call admission problems on trees

This page was built for publication: Call admission problems on grids with advice (extended abstract)

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