Length-Weighted Disjoint Path Allocation

DOI10.1007/978-3-319-98355-4_14MaRDI QIDQ6163628zbMATH OpenOpenAlexFDO

Authors Elisabet Burjons, Fabian Frei, Jasmin Smula, David Wehner

Publication date 30 June 2023

Published in Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-98355-4_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Advice complexity of disjoint path allocation
• On the power of advice and randomization for the disjoint path allocation problem
• Disjoint path allocation with sublinear advice
• Weighted online problems with advice
• Weighted Online Problems with Advice

Cites work

• Advice complexity of disjoint path allocation
• Disjoint path allocation with sublinear advice
• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Information complexity of online problems
• Measuring the problem-relevant information in input
• On the power of advice and randomization for the disjoint path allocation problem
• Online algorithms with advice: the tape model
• Online computation with advice

Cited in

(5)

• Call admission problems on trees
• On the power of advice and randomization for the disjoint path allocation problem
• Advice complexity of disjoint path allocation
• Disjoint path allocation with sublinear advice
• Priority algorithms with advice for disjoint path allocation problems

This page was built for publication: Length-Weighted Disjoint Path Allocation

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