Výsledky vyhľadávania - "2012 ACM Subject Classification Theory of computation → Online algorithms"

The Canadian Traveller Problem on Outerplanar Graphs

Autori: Beaudou, Laurent Bergé, Pierre Chernyshev, Vsevolod a ďalší

Prispievatelia: Beaudou, Laurent Bergé, Pierre Chernyshev, Vsevolod a ďalší

Zdroj: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs)
Mathematical Foundations of Computer Science (MFCS)
https://hal.science/hal-04818742
Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩

Predmety: 2012 ACM Subject Classification Theory of computation → Online algorithms Theory of computation → Graph algorithms analysis Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Online algorithms, Competitive analysis, Outerplanar graphs, 2012 ACM Subject Classification Theory of computation → Online algorithms, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Canadian Traveller Problem, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Geografické téma: Bratislava, Slovakia

Dostupnosť: https://hal.science/hal-04818742
https://hal.science/hal-04818742v1/document
https://hal.science/hal-04818742v1/file/LIPIcs.MFCS.2024.19.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2024.19