Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Crevel Bautista-Santiago"'
Autor:
Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy, David Flores-Peñaloza, Hernàn González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 3, Iss Combinatorics (2013)
Combinatorics
Externí odkaz:
https://doaj.org/article/c046a418cb3a4b92b10e77bce864c81a
Autor:
Ruy Fabila-Monroy, Crevel Bautista-Santiago, David Flores-Peñaloza, Dolores Lara, Jorge Urrutia, José Miguel Díaz-Báñez
Publikováno v:
European Journal of Operational Research. 216:278-285
Consider a set of mobile clients represented by n points in the plane moving at constant speed along n different straight lines. We study the problem of covering all mobile clients using a set of k disks centered at k fixed centers. Each disk exists
Autor:
Jorge Urrutia, Dolores Lara, Inmaculada Ventura, Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Pablo Pérez-Lantero
Publikováno v:
Operations Research Letters. 39:246-251
Let S be a bicolored set of n points in the plane. A subset I of S is an island if there is a convex set C such that I=C@?S. We give an O(n^3)-time algorithm to compute a monochromatic island of maximum cardinality. Our approach is adapted to optimiz
Autor:
Eliseo Sarmiento, David Flores-Peñaloza, Ruy Fabila-Monroy, Jorge Urrutia, Javier Cano, Dolores Lara, Crevel Bautista-Santiago, Hernán González-Aguilar
Publikováno v:
Publons
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 3 (3), pp.21--30
Eliseo Sarmiento
Scopus-Elsevier
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 3 (3), pp.21--30
Eliseo Sarmiento
Scopus-Elsevier
Combinatorics
Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P \C. In this paper we define the generalized island Johnson graph of P as the graph whos
Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P \C. In this paper we define the generalized island Johnson graph of P as the graph whos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c40c130e9a3d12db5bc3c0897d4eaafd
https://publons.com/publon/9367167/
https://publons.com/publon/9367167/