Advice complexity of disjoint path allocation

DOI10.1051/ita/2016020zbMath1401.68122DBLPjournals/ita/Kovacova16OpenAlexW2551218028WikidataQ60692315 ScholiaQ60692315MaRDI QIDQ2953693

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 complexityonline problemsdisjoint path allocation

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)

Related Items (1)

Length-Weighted Disjoint Path Allocation

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Online computation with advice
• Online algorithms: a survey
• On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
• On the Advice Complexity of Online Problems
• Bounds for Certain Multiprocessing Anomalies

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