3 papers
cs.DM2022
Algorithms for the Euclidean Bipartite Edge Cover Problem
Rodrigo A. Castro, José M. Díaz-Báñez, Marco A. Heredia +3
Given a graph with costs on its edges, the minimum-cost edge cover problem consists of finding a subset of covering all vertices in at minimum cost. If is bip…
cs.CG2012
The 1-Center and 1-Highway problem
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1
We study a variation of the 1-center problem in which, in addition to a single supply facility, we are allowed to locate a highway. This highway increases the transportation speed…
cs.CG2012
Locating a single facility and a high-speed line
José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1
In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimiz…