Lehilton L. C. Pedrosa

According to our database1, Lehilton L. C. Pedrosa authored at least 25 papers between 2010 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Improved approximation for the capacitated inventory access point problem.
Oper. Res. Lett., 2021

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

On the Inapproximability of the Cable-Trench Problem.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

An efficient parameterized approximation scheme for the Star k-Hub Center.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Approximation algorithms for the MAXSPACE advertisement problem.
CoRR, 2020

A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Approximating Routing and Connectivity Problems with Multiple Distances.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Approximation algorithms for Median Hub Location Problems.
J. Comb. Optim., 2019

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Computing the Largest Bond of a Graph.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

An Asymptotically Optimal Approximation Algorithm for the Travelling Car Renter Problem.
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

Approximation algorithms for the bus evacuation problem.
J. Comb. Optim., 2018

Integrated Supply Chain Management via Randomized Rounding.
INFORMS J. Comput., 2018

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.
Algorithmica, 2018

Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency.
Proceedings of the 87th IEEE Vehicular Technology Conference, 2018

Clustering through Continuous Facility Location Problems.
Theor. Comput. Sci., 2017

A PTAS for the Geometric Connected Facility Location Problem.
Theory Comput. Syst., 2017

Approximation algorithms for k-level stochastic facility location problems.
J. Comb. Optim., 2017

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

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

Polynomial-Time Approximation Schemes for Circle Packing Problems.
Proceedings of the Algorithms - ESA 2014, 2014

Incremental testing of finite state machines.
Softw. Test. Verification Reliab., 2013

Squared Metric Facility Location Problem
CoRR, 2011

Generalized Partial Test Case Generation Method.
Proceedings of the Fourth International Conference on Secure Software Integration and Reliability Improvement, 2010

A New Method for Incremental Testing of Finite State Machines.
Proceedings of the Second NASA Formal Methods Symposium, 2010