The following pages link to Lehilton L. C. Pedrosa (Q329297):
Displaying 23 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Clustering through continuous facility location problems (Q346248) (← links)
- Approximation algorithms for the bus evacuation problem (Q724742) (← links)
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
- Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
- Approximating routing and connectivity problems with multiple distances (Q2081602) (← links)
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem (Q2132409) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Approximation algorithms for \(k\)-level stochastic facility location problems (Q2410048) (← links)
- Approximation algorithms for median hub location problems (Q2424817) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Improved approximation for the capacitated inventory access point problem (Q2670449) (← links)
- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center (Q2802959) (← links)
- Polynomial-Time Approximation Schemes for Circle Packing Problems (Q2921456) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5405073) (← links)
- Computing the largest bond of a graph (Q5875544) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5918502) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
- Approximation algorithms for the MAXSPACE advertisement problem (Q6580082) (← links)
- An asymptotically optimal approximation algorithm for the travelling car renter problem (Q6591926) (← links)
- Algorithms for the bin packing problem with scenarios (Q6646755) (← links)
