Hugo K. K. Rosado

According to our database, Hugo K. K. Rosado authored at least 6 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.

Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Scheduling on a Stochastic Number of Machines.

Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese

Proceedings of the Approximation, 2024

2023

On the complexity of the Cable-Trench Problem.

Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado

Discret. Appl. Math., December, 2023

A (3+ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.

Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese

CoRR, 2023

2022

A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem.

Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado

Algorithmica, 2022

2021

On the Inapproximability of the Cable-Trench Problem.

Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021