3 research outputs found
Optimización de la distribución de vacunas para prevenir epidemias
No full textObjetivos: 1. Crear un modelo preciso del problema planteado en la Sección . Este modelo caerá dentro de la categoría de problemas de localización de facilidades, 2. Obtener algoritmos que, de ser factible, resuelvan de manera exacta el problema. En caso de no ser así, (por ejemplo, en el caso de que el problema sea N P -duro) dar algoritmos que den aproximaciones buenas a la solución óptima del problema (por ejemplo, algoritmos genéticos), 3. Paralelizar en medida de lo posible los algoritmos que se desarrollen para el problema, 4. Desarrollar un sistema que permita modelar problemas con características similares. Protocolo de investigació
An ongoing project to improve the rectilinear and the pseudolinear crossing constants
No full textA drawing of a graph in the plane is pseudolinear if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of these curves crosses precisely once. A special case is rectilinear drawings where the edges of the graph are drawn as straight line segments. The rectilinear (pseudolinear) crossing number of a graph is the minimum number of pairs of edges of the graph that cross in any of its rectilinear (pseudolinear) drawings. In this paper we describe an ongoing project to continuously obtain better asymptotic upper bounds on the rectilinear and pseudolinear crossing number of the complete graph Kn
The Chromatic Number of the Disjointness Graph of the Double Chain
No full textLet be a set of points in general position in the plane.
Consider all the closed straight line segments with both endpoints in .
Suppose that these segments are colored with the rule that disjoint segments
receive different colors. In this paper we show that if is the point
configuration known as the double chain, with points in the upper convex
chain and points in the lower convex chain, then colors are needed and that
this number is sufficient
