Length-Weighted Disjoint Path Allocation

Autor:	Jasmin Smula, Elisabet Burjons, David Wehner, Fabian Frei
Rok vydání:	2018
Předmět:	Disjoint path Theoretical computer science Competitive analysis Feature (computer vision) Computer science Viewpoints Parametrization TRACE (psycholinguistics)
Zdroj:	Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications ISBN: 9783319125671 Adventures Between Lower Bounds and Higher Altitudes
DOI:	10.1007/978-3-319-98355-4_14
Popis:	We modify one of the foundational online problems, Disjoint Path Allocation, to include weighted requests. We provide a comprehensive competitive analysis, incorporating the viewpoints of both advice complexity and parametrized complexity. Our bounds feature a consistent parametrization and closely trace the trade-off between advice complexity and competitiveness.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c2222171894d596a137e861ee69b06dd https://doi.org/10.1007/978-3-319-98355-4_14 Zobrazit plný text záznamu