Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Lukas Nölke"'
Autor:
Joachim Spoerhase, Margarita Capretto, Antonios Antoniadis, Peter Kling, Nidia Obscura Acosta, Lukas Nölke, Christoph Damerius, Parinya Chalermsook
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings, 85-100
STARTPAGE=85;ENDPAGE=100;TITLE=Algorithms and Data Structures
WADS
Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings, 85-100
STARTPAGE=85;ENDPAGE=100;TITLE=Algorithms and Data Structures
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points P in the plane, together with a subset of pairs of points in P (which we call demands), find a minimum-cardinality superset of P such that e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84d6b8a0cedf84aaf3e925115c450550
https://doi.org/10.1007/978-3-030-83508-8_7
https://doi.org/10.1007/978-3-030-83508-8_7
Publikováno v:
SIAM journal on discrete mathematics, 36(2), 1249-1273. Society for Industrial and Applied Mathematics Publications
We consider the problem of computing a Steiner tree of minimum cost under a hop constraint which requires the depth of the tree to be at most $k$. Our main result is an exact algorithm for metrics induced by graphs with bounded treewidth that runs in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e414bebd5d8ef969144b9ae0170d8497
http://arxiv.org/abs/2003.05699
http://arxiv.org/abs/2003.05699
Publikováno v:
Mathematical programming, 197(2). Springer
The speed-robust scheduling problem is a two-stage problem where, given m machines, jobs must be grouped into at most m bags while the processing speeds of the machines are unknown. After the speeds are revealed, the grouped jobs must be assigned to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9665716297914c3c7a2e3288783542a