Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jan Hackfeld"'
Autor:
Arie M. C. A. Koster, Jan Hackfeld
Publikováno v:
Journal of Combinatorial Optimization. 35:853-859
A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with $$0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7aac1fd1923e0fd86f7c59b926155858
https://doi.org/10.1007/s10878-017-0226-x
https://doi.org/10.1007/s10878-017-0226-x
We study the problem of deterministically exploring an undirected and initially unknown graph with n vertices either by a single agent equipped with a set of pebbles or by a set of collaborating agents. The vertices of the graph are unlabeled and can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e73f0df265a5b59d932710a462fb1011
Autor:
Antje Bjelde, Leen Stougie, Jan Hackfeld, Miriam Schlöter, Julie Meißner, Yann Disser, Maarten Lipmann, Kevin Schewior, Christoph Hansknecht
Publikováno v:
ACM-SIAM Symposium on Discrete Algorithms (SODA)
ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2017, Barcelona, Spain. pp.994-1005, ⟨10.1137/1.9781611974782.63⟩
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 994-1005
STARTPAGE=994;ENDPAGE=1005;TITLE=Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
ACM Transactions on Algorithms, 17(1)
ACM Transactions on Algorithms
ACM Transactions on Algorithms, Association for Computing Machinery, 2021, 17 (1), pp.1-58. ⟨10.1145/3422362⟩
ACM Transactions on Algorithms, 2021, 17 (1), pp.1-58. ⟨10.1145/3422362⟩
ACM Transactions on Algorithms, 17(1):3, 1-58. Association for Computing Machinery (ACM)
Bjelde, A, Disser, Y, Hackfeld, J, Hansknecht, C, Lippmann, M, Meissner, J, Schewior, K, Schloter, M & Stougie, L 2017, Tight Bounds for Online TSP on the Line . in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) . ACM, pp. 994-1005 . https://doi.org/10.1137/1.9781611974782.63
Bjelde, A, Hackfeld, J, Disser, Y, Hansknecht, C, Lipmann, M, Meißner, J, Schlöter, M, Schewior, K & Stougie, L 2021, ' Tight Bounds for Online TSP on the Line ', ACM Transactions on Algorithms, vol. 17, no. 1, 3, pp. 1-58 . https://doi.org/10.1145/3422362
ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2017, Barcelona, Spain. pp.994-1005, ⟨10.1137/1.9781611974782.63⟩
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 994-1005
STARTPAGE=994;ENDPAGE=1005;TITLE=Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
ACM Transactions on Algorithms, 17(1)
ACM Transactions on Algorithms
ACM Transactions on Algorithms, Association for Computing Machinery, 2021, 17 (1), pp.1-58. ⟨10.1145/3422362⟩
ACM Transactions on Algorithms, 2021, 17 (1), pp.1-58. ⟨10.1145/3422362⟩
ACM Transactions on Algorithms, 17(1):3, 1-58. Association for Computing Machinery (ACM)
Bjelde, A, Disser, Y, Hackfeld, J, Hansknecht, C, Lippmann, M, Meissner, J, Schewior, K, Schloter, M & Stougie, L 2017, Tight Bounds for Online TSP on the Line . in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) . ACM, pp. 994-1005 . https://doi.org/10.1137/1.9781611974782.63
Bjelde, A, Hackfeld, J, Disser, Y, Hansknecht, C, Lipmann, M, Meißner, J, Schlöter, M, Schewior, K & Stougie, L 2021, ' Tight Bounds for Online TSP on the Line ', ACM Transactions on Algorithms, vol. 17, no. 1, 3, pp. 1-58 . https://doi.org/10.1145/3422362
We consider the online traveling salesperson problem (TSP), where requests appear online over time on the real line and need to be visited by a server initially located at the origin. We distinguish between closed and open online TSP, depending on wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbb0b01a7b9df55ef71374d5bb43eb1b
https://ir.cwi.nl/pub/26449
https://ir.cwi.nl/pub/26449