Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Gasparoux, Marie"'
The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently been publi
Externí odkaz:
http://arxiv.org/abs/1805.00060
The Shortest Superstring Problem (SSP) consists, for a set of strings S = {s_1,...,s_n}, to find a minimum length string that contains all s_i, 1 <= i <= k, as substrings. This problem is proved to be NP-Complete and APX-hard. Guaranteed approximatio
Externí odkaz:
http://arxiv.org/abs/1605.05542
The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf206f2d5345c380e09eefdd535d259d
https://hal.archives-ouvertes.fr/hal-02414032/document
https://hal.archives-ouvertes.fr/hal-02414032/document
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs)
29th Annual Symposium on Combinatorial Pattern Matching (CPM'18)
29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), Jul 2018, Qingdao, China. pp.6:1--6:14
29th Annual Symposium on Combinatorial Pattern Matching (CPM'18)
29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), Jul 2018, Qingdao, China. pp.6:1--6:14
In this paper, we study circular words arising in the development of equipment using shields in brachytherapy. This equipment has physical constraints that have to be taken into consideration. From an algorithmic point of view, the problem can be for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c41c5457025e6a4aed1a599f5509f04
https://hal.archives-ouvertes.fr/hal-01742563
https://hal.archives-ouvertes.fr/hal-01742563
Publikováno v:
Combinatorial Algorithms: 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings; 2016, p309-320, 12p