Advice complexity of disjoint path allocation

DOI10.1051/ITA/2016020MaRDI QIDQ2953693zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ivana Kováčová

Publication date 5 January 2017

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2016020

zbMATH Keywords

advice complexitydisjoint path allocationonline problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• On the power of advice and randomization for the disjoint path allocation problem
• Disjoint path allocation with sublinear advice
• Advice complexity for a class of online problems
• Length-Weighted Disjoint Path Allocation
• The advice complexity of a class of hard online problems

Cites work

• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• On the Advice Complexity of Online Problems
• On the power of advice and randomization for the disjoint path allocation problem
• Online algorithms: a survey
• Online computation with advice

Cited in

(5)

• Call admission problems on grids with advice (extended abstract)
• On the power of advice and randomization for the disjoint path allocation problem
• Disjoint path allocation with sublinear advice
• Length-Weighted Disjoint Path Allocation
• Priority algorithms with advice for disjoint path allocation problems

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Advice complexity of disjoint path allocation

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