3 papers
cs.DS2024
Scheduling on a Stochastic Number of Machines
Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado +2
We consider a new scheduling problem on parallel identical machines in which the number of machines is initially not known, but it follows a given probability distribution. Only af…
cs.DS2023
A -approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds
Moritz Buchem, Katja Ettmayr, Hugo Kooki Kasuya Rosado +1
For a given set of points in a metric space and an integer , we seek to partition the given points into clusters. For each computed cluster, one typically defines one point…
cs.CC2019
A 2-approximation for the -prize-collecting Steiner tree problem
Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado
We consider the -prize-collecting Steiner tree problem. An instance is composed of an integer and a graph with costs on edges and penalties on vertices. The objective is…