Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Giuseppe Lancia"'
Autor:
Giuseppe Lancia, Paolo Serafini
Publikováno v:
Algorithms, Vol 14, Iss 8, p 235 (2021)
Logical Analysis of Data is a procedure aimed at identifying relevant features in data sets with both positive and negative samples. The goal is to build Boolean formulas, represented by strings over {0,1,-} called patterns, which can be used to clas
Externí odkaz:
https://doaj.org/article/ff35087114024129b93d15a8adf24b31
Autor:
Giuseppe Lancia, Marcello Dalpasso
Publikováno v:
Algorithms, Vol 13, Iss 11, p 306 (2020)
Given a Traveling Salesman Problem solution, the best 3-OPT move requires us to remove three edges and replace them with three new ones so as to shorten the tour as much as possible. No worst-case algorithm better than the Θ(n3) enumeration of all t
Externí odkaz:
https://doaj.org/article/95ded8db4ed047e2a24569850702eea5
Autor:
Giuseppe Lancia, Marcello Dalpasso
Publikováno v:
Algorithms, Vol 12, Iss 5, p 91 (2019)
We describe a simple data structure for storing subsets of { 0 , … , N − 1 } , with N a given integer, which has optimal time performance for all the main set operations, whereas previous data structures are non-optimal for at least one such oper
Externí odkaz:
https://doaj.org/article/216138846a9e4a27a059754b6cd752ea
Autor:
Giuseppe Lancia
Publikováno v:
Algorithms, Vol 1, Iss 2, Pp 100-129 (2008)
The field of computational biology has experienced a tremendous growth in the past 15 years. In this bibliography, we survey some of the most significant contributions that were made to the field and which employ mathematical programming techniques,
Externí odkaz:
https://doaj.org/article/add745558b2f4682834decf64a9dbf90
Autor:
Giuseppe Lancia, Paolo Vidoni
Publikováno v:
European Journal of Operational Research. 286:458-467
Finding the largest triangle in an n-nodes edge-weighted graph belongs to a set of problems all equivalent under subcubic reductions. Namely, a truly subcubic algorithm for any one of them would imply that they are all subcubic. A recent strong conje
Autor:
Paolo Serafini, Giuseppe Lancia
Publikováno v:
Algorithms
Volume 14
Issue 8
Algorithms, Vol 14, Iss 235, p 235 (2021)
Volume 14
Issue 8
Algorithms, Vol 14, Iss 235, p 235 (2021)
Logical Analysis of Data is a procedure aimed at identifying relevant features in data sets with both positive and negative samples. The goal is to build Boolean formulas, represented by strings over {0,1,-} called patterns, which can be used to clas
Publikováno v:
Theoretical Computer Science. 665:73-86
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in understanding the
Publikováno v:
Mathematical Optimization Theory and Operations Research ISBN: 9783030499877
MOTOR
MOTOR
It is known that there exist 4-regular, 1-tough graphs which are non-hamiltonian. The smallest such graph known has \(n=18\) nodes and was found by Bauer et al., who conjectured that all 4-regular, 1-tough graphs with \(n\le 17\) are hamiltonian. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c4ca9d1d22b3a18ffd609ab2190f98b
https://doi.org/10.1007/978-3-030-49988-4_5
https://doi.org/10.1007/978-3-030-49988-4_5
Autor:
Giuseppe Lancia
Publikováno v:
RAIRO - Operations Research. 50:331-340
Since its introduction in 2001, the Single Individual Haplotyping problem has received an ever-increasing attention from the scientific community. In this paper we survey, in the form of an annotated bibliography, the developments in the study of the
Autor:
Marcello Dalpasso, Giuseppe Lancia
Publikováno v:
AIRO Springer Series ISBN: 9783030349592
The 4-OPT neighborhood for the TSP contains Θ(n4) moves so that finding the best move effectively requires some ingenuity. Recently, de Berg et al. have given a Θ(n3) dynamic program, but the cubic complexity is still too large for using 4-OPT in p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::163a067dc0b614c0869bcfd49595a62b
https://doi.org/10.1007/978-3-030-34960-8_40
https://doi.org/10.1007/978-3-030-34960-8_40