Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Leniowski Dariusz"'
We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show
Externí odkaz:
http://arxiv.org/abs/1909.06653
Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is static, thus failing to capture many real-world applications where data
Externí odkaz:
http://arxiv.org/abs/1908.03948
In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the sol
Externí odkaz:
http://arxiv.org/abs/1707.02577
The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it has been widely applied in many different settings. Surprisingly, desp
Externí odkaz:
http://arxiv.org/abs/1704.02093
Publikováno v:
In Theoretical Computer Science 12 January 2022 901:45-61
Publikováno v:
In Theoretical Computer Science 11 January 2015 562:90-100
Autor:
Bosek, Bartłomiej1 (AUTHOR) bosek@tcs.uj.edu.pl, Leniowski, Dariusz2 (AUTHOR) d.leniowski@mimuw.edu.pl, Sankowski, Piotr2 (AUTHOR) sank@mimuw.edu.pl, Zych-Pawlewicz, Anna2 (AUTHOR) anka@mimuw.edu.pl
Publikováno v:
Theory of Computing Systems. Feb2018, Vol. 62 Issue 2, p337-348. 12p.
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2020, ⟨10.1007/s00453-020-00721-7⟩
Algorithmica, Springer Verlag, 2020, ⟨10.1007/s00453-020-00721-7⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::a0a474cb3ada0ba153b49f26f03e5b01
https://hal.inria.fr/hal-02697242
https://hal.inria.fr/hal-02697242
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bushell Michael E, Avignone-Rossa Claudio, Markowski Mateusz, Łącki Jakub, Leniowski Dariusz, Gwóźdź Szymon, Bieniasz-Krzywiec Łukasz, Sroka Jacek, McFadden Johnjoe, Kierzek Andrzej M
Publikováno v:
BMC Bioinformatics, Vol 12, Iss 1, p 196 (2011)
Abstract Background Constraint-based approaches facilitate the prediction of cellular metabolic capabilities, based, in turn on predictions of the repertoire of enzymes encoded in the genome. Recently, genome annotations have been used to reconstruct
Externí odkaz:
https://doaj.org/article/00f2babefdcf49639ec2c0ad213718fc