Lehilton L. C. Pedrosa

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 29

Top Topics

Facility Location Problem

Approximation Algorithms

Top Venues

J. Comb. Optim.

Publications

Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery
Approximation Algorithms for the MAXSPACE Advertisement Problem. Theory Comput. Syst. 68 (3) (2024)
Lehilton L. C. Pedrosa, Mauro R. C. da Silva, Rafael C. S. Schouery
Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement). LAGOS (2023)
Yulle G. F. Borges, Vinícius Loti de Lima, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Thiago Alves de Queiroz, Rafael C. S. Schouery
Algorithms for the Bin Packing Problem with Scenarios. CoRR (2023)
Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo Kooki Kasuya Rosado
On the complexity of the Cable-Trench Problem. Discret. Appl. Math. 340 (2023)
Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa
A parameterized approximation algorithm for the Multiple Allocation k-Hub Center. CoRR (2022)
Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa
A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center. LATIN (2022)
Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa
An efficient parameterized approximation scheme for the Star k-Hub Center. LAGOS (2021)
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83 (5) (2021)
Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo Kooki Kasuya Rosado
On the Inapproximability of the Cable-Trench Problem. LAGOS (2021)
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR (2020)
Mauro R. C. da Silva, Lehilton L. C. Pedrosa, Rafael C. S. Schouery
Approximation algorithms for the MAXSPACE advertisement problem. CoRR (2020)
Lehilton L. C. Pedrosa, Hugo Kooki Kasuya Rosado
A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem. LATIN (2020)
Lehilton L. C. Pedrosa, Greis Y. O. Quesquén
Approximating Routing and Connectivity Problems with Multiple Distances. LATIN (2020)
Mauro R. C. da Silva, Rafael C. S. Schouery, Lehilton L. C. Pedrosa
A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem. LAGOS (2019)
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the Largest Bond of a Graph. IPEC (2019)
Lehilton L. C. Pedrosa, Greis Y. O. Quesquén, Rafael C. S. Schouery
An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem. ATMOS (2019)
Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa
Approximation algorithms for Median Hub Location Problems. J. Comb. Optim. 38 (2) (2019)
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza
Computing the largest bond of a graph. CoRR (2019)
Lehilton L. C. Pedrosa, Maxim Sviridenko
Integrated Supply Chain Management via Randomized Rounding. INFORMS J. Comput. 30 (1) (2018)
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. Algorithmica 80 (3) (2018)
Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery
Approximation algorithms for the bus evacuation problem. J. Comb. Optim. 36 (1) (2018)
Allan Mariano de Souza, Lehilton L. C. Pedrosa, Leonardo C. Botega, Leandro Villas
Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency. VTC Spring (2018)
Lucas P. Melo, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery
Approximation algorithms for k-level stochastic facility location problems. J. Comb. Optim. 34 (1) (2017)
Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
Clustering through Continuous Facility Location Problems. Theor. Comput. Sci. 657 (2017)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Renata G. D. de Souza
A PTAS for the Geometric Connected Facility Location Problem. Theory Comput. Syst. 61 (3) (2017)
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. LATIN (2016)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. Algorithmica 76 (2) (2016)
Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa
Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center. CoRR (2016)
Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Math. Program. 153 (2) (2015)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems. CoRR (2014)
Lehilton L. C. Pedrosa, Maxim Sviridenko
Integrated Supply Chain Management via Randomized Rounding. LATIN (2014)
Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi
Polynomial-Time Approximation Schemes for Circle Packing Problems. ESA (2014)
Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
A Systematic Approach to Bound Factor Revealing LPs and Its Application to the Metric and Squared Metric Facility Location Problems. APPROX-RANDOM (2012)
Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa
Squared Metric Facility Location Problem CoRR (2011)
Lehilton L. C. Pedrosa, Arnaldo V. Moura
A New Method for Incremental Testing of Finite State Machines. NASA Formal Methods (2010)