CV Lattes
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation for the last research proposal) Birthplace: Brazil
Bachelor- Computer Science - University of Brasília (2007), MSc - Computer Science - University of Campinas (2010), PhD - Computer Science - University of Campinas (2014). Currently Assistent professor at Institute of Computing - University of Campinas. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| TITULO |
| Articles published in other media outlets (0 total): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
Pair connectivity problems are a branch of location problems, in which weposition structures in order to satisfy connectivity constraints between pairs of points in a network. Many problems with practical interest can be classified as this, like the Hub Location Problem (HLP), in which demands between pairs of clients must be connected using network terminals, with the product flow passin…
In several applications (e.g., transport, logistics, telecommunications, postal services and distribution networks), we need to install hubs, such as terminal airports or network switches. A hub is a consolidation and exchange center which allows direct connection, using a smaller number of indirect connections. In this project, we will study the hub allocation problems and variants. An e…
Approximation algorithms are applied to combinatorial optimization problems, with the goal of efficiently obtaining solutions with guaranteed quality. The study of such algorithms leads to theoretical results that reveals a problem's structure and computational difficulty. In this project, we will investigate hub location problems (HLP) under the view of approximation algorithms. Given a …
The aim of this post-doctorate project is to study and to obtain approximation algorithms or inapproximability results for combinatorial optimization problems, specially those related to network design under more realistic constraints.The classical network design problems, such as k-center, k-median and facility location have a wide list of applications, such as router allocation, network…
(Only some records are available in English at this moment)
Approximation algorithms have received great attention from the research community working on optimization and computer theory. Such algorithms are mainly used to solve NP-hard problems, for which no exact algorithm would be viable. There are several techniques used to obtain approximations for the facility location problem and others. Usually, these techniques can be used when dealing wi…
| 1 / 1 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 5 / 5 | Completed scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 8 / 8 | All research grants and scholarships |
| Associated processes | |