Lehilton Lelis Chaves Pedrosa

• 12th Latin American Theoretical Informatics Symposium, AR.EXT

• Abstract

  Robot activation problems arise naturally in the context of swarm robotics. In particular, the Freeze-Tag Problem (FTP) consists of activating a set of "asleep" robots from just one initially active one by moving to the dormant robots' location. Once a robot is awake, it can assist in awakening other robots. The objective is to find a strategy to activate the entire set in the shortest po…

  Parameterized Algorithms for the Freeze-Tag Problem over Different Domains, BP.MS

• Abstract

  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…

  Approximation and parameterized algorithms for pair connectivity problems, BP.DR

• Abstract

  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…

  Algorithms for Min-Max p-hub location problems and variants, BP.IC

(Only some records are available in English at this moment)

• Abstract

  Swarm robotics is a topic of ever-growing interest mainly driven by several successful practical applications, from scheduling agriculture machinery to controlling satellites around Earth. The need to control or schedule robot operations often leads to intractable optimization problems. The candidate's Master's research project focuses on studying the complexity and parameterization of th…

  Algorithms for the freeze-tag and related swarm robotics problems, BE.EP.MS

• Abstract

  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…

  Advanced algorithms for facility location, inventory management and other supply chain optimization problems, BE.EP.DR