Lehilton L. C. Pedrosa

According to our database, Lehilton L. C. Pedrosa authored at least 30 papers between 2010 and 2024.

Collaborative distances:

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

2024

Algorithms for the bin packing problem with scenarios.

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

J. Comb. Optim., November, 2024

Approximation Algorithms for the MAXSPACE Advertisement Problem.

Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery

Theory Comput. Syst., June, 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

Positional Knapsack Problem: NP-hardness and approximation scheme (Brief Announcement).

Lehilton L. C. Pedrosa, Mauro Roberto Costa da Silva, Rafael C. S. Schouery

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Freeze-Tag is NP-hard in 3D with L₁ distance.

Lehilton Lelis Chaves Pedrosa, Lucas de Oliveira Silva

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

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

Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado

Algorithmica, 2022

A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center.

Marcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Improved approximation for the capacitated inventory access point problem.

Miguel Ángel Marfurt Alarcón, Lehilton Lelis Chaves Pedrosa

Oper. Res. Lett., 2021

Computing the Largest Bond and the Maximum Connected Cut of a Graph.

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

Algorithmica, 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

An efficient parameterized approximation scheme for the Star k-Hub Center.

Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa

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

2020

Approximating Routing and Connectivity Problems with Multiple Distances.

Lehilton L. C. Pedrosa, Greis Y. O. Quesquén

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Approximation algorithms for Median Hub Location Problems.

Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa

J. Comb. Optim., 2019

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem.

Mauro Roberto Costa da Silva, Rafael C. S. Schouery, Lehilton L. C. Pedrosa

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Computing the Largest Bond of a Graph.

Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Uéverton S. Souza

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem.

Lehilton L. C. Pedrosa, Greis Y. O. Quesquén, Rafael C. S. Schouery

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

Approximation algorithms for the bus evacuation problem.

Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery

J. Comb. Optim., 2018

Integrated Supply Chain Management via Randomized Rounding.

Lehilton L. C. Pedrosa, Maxim Sviridenko

INFORMS J. Comput., 2018

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.

Cristina G. Fernandes, Samuel P. de Paula, Lehilton L. C. Pedrosa

Algorithmica, 2018

Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency.

Allan Mariano de Souza, Lehilton L. C. Pedrosa, Leonardo C. Botega, Leandro Villas

Proceedings of the 87th IEEE Vehicular Technology Conference, 2018

2017

Clustering through Continuous Facility Location Problems.

Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa

Theor. Comput. Sci., 2017

A PTAS for the Geometric Connected Facility Location Problem.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Renata G. D. de Souza

Theory Comput. Syst., 2017

Approximation algorithms for k-level stochastic facility location problems.

Lucas P. Melo, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery

J. Comb. Optim., 2017

2016

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi

Algorithmica, 2016

2015

A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems.

Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa

Math. Program., 2015

2014

Polynomial-Time Approximation Schemes for Circle Packing Problems.

Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael Crivellari Saliba Schouery, Maxim Sviridenko, Yoshiko Wakabayashi

Proceedings of the Algorithms - ESA 2014, 2014

2013

Incremental testing of finite state machines.

Lehilton Lelis Chaves Pedrosa, Arnaldo Vieira Moura

Softw. Test. Verification Reliab., 2013

2011

Squared Metric Facility Location Problem

Cristina G. Fernandes, Luis A. A. Meira, Flávio Keidi Miyazawa, Lehilton L. C. Pedrosa

CoRR, 2011

2010

Generalized Partial Test Case Generation Method.

Lehilton Lelis Chaves Pedrosa, Arnaldo Vieira Moura

Proceedings of the Fourth International Conference on Secure Software Integration and Reliability Improvement, 2010

A New Method for Incremental Testing of Finite State Machines.

Lehilton L. C. Pedrosa, Arnaldo V. Moura

Proceedings of the Second NASA Formal Methods Symposium, 2010