Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Fabrizio Grandoni"'
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64f470f22b1521685b51b42231418a02
https://doi.org/10.1007/s00453-023-01130-2
https://doi.org/10.1007/s00453-023-01130-2
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::222e23c01ef102776bf65c4145c0460d
https://doi.org/10.1137/1.9781611977554.ch92
https://doi.org/10.1137/1.9781611977554.ch92
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d7e58da42a160785fc2be86e192b436
https://doi.org/10.1137/1.9781611977554.ch37
https://doi.org/10.1137/1.9781611977554.ch37
Publikováno v:
ACM Transactions on Algorithms. 16:1-25
Shortest paths computation is one of the most fundamental problems in computer science. An important variant of the problem is when edges can fail, and one needs to compute shortest paths that avoid a (failing) edge. More formally, given a source nod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d570225fb517feec186a059286c59c57
https://doi.org/10.1145/3365835
https://doi.org/10.1145/3365835
In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the squared E
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb87a220398dbaf12a0a9076a580e384
http://arxiv.org/abs/2107.07358
http://arxiv.org/abs/2107.07358
Publikováno v:
SIAM Journal on Computing. 52:STOC19-298
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b0372fbdbf1a6c8615d6a37224aa214
https://doi.org/10.1137/20m1312988
https://doi.org/10.1137/20m1312988
Publikováno v:
Theory of Computing Systems.
In the k-Connectivity Augmentation Problem we are given a k-edge-connected graph and a set of additional edges called links. Our goal is to find a set of links of minimum size whose addition to the graph makes it (k + 1)-edge-connected. There is an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ff923f3063dac88a8c1031081f69e8b
https://doi.org/10.1007/s00224-020-10025-6
https://doi.org/10.1007/s00224-020-10025-6
Autor:
Fabrizio Grandoni, Giuseppe F. Italian, Aleksander Łukasiewicz, Nikos Parotsidis, Przemysław Uznański
Publikováno v:
SODA 2021-ACM-SIAM Symposium on Discrete Algorithms
SODA 2021-ACM-SIAM Symposium on Discrete Algorithms, Jan 2021, Alexandria, United States. pp.273-289, ⟨10.1137/1.9781611976465.18⟩
SODA 2021-ACM-SIAM Symposium on Discrete Algorithms, Jan 2021, Alexandria, United States. pp.273-289, ⟨10.1137/1.9781611976465.18⟩
Let $G=(V,E)$ be an $n$-vertex directed acyclic graph (DAG). A lowest common ancestor (LCA) of two vertices $u$ and $v$ is a common ancestor $w$ of $u$ and $v$ such that no descendant of $w$ has the same property. In this paper, we consider the probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::071f31bc42289b99ba1c24a31c59babe
https://inria.hal.science/hal-03474036/document
https://inria.hal.science/hal-03474036/document