Search Results - "Pedrosa, Lehilton L. C."

A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems by Fernandes, Cristina G., Meira, Luis A. A., Miyazawa, Flávio K., Pedrosa, Lehilton L. C.

“…A systematic technique to bound factor-revealing linear programs is presented. We show how to derive a family of upper bound factor-revealing programs (UPFRP),…”
Get full text

A PTAS for the Geometric Connected Facility Location Problem by Miyazawa, Flávio K., C. Pedrosa, Lehilton L., S. Schouery, Rafael C., D. de Souza, Renata G.

“…We consider the Geometric Connected Facility Location Problem (GCFLP): given a set of clients C ⊂ ℝ d , one wants to select a set of locations F ⊂ ℝ d where to…”
Get full text

Approximation Algorithms for the MAXSPACE Advertisement Problem by Pedrosa, Lehilton L. C., da Silva, Mauro R. C., Schouery, Rafael C. S.

“…In MAXSPACE, given a set of ads A , one wants to schedule a subset A ′ ⊆ A into K slots B 1 , ⋯ , B K of size L . Each ad  A i ∈ A has a size   s i and a…”
Get full text

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center by Fernandes, Cristina G., de Paula, Samuel P., Pedrosa, Lehilton L. C.

“…In the k -center problem, given a metric space  V and a positive integer  k , one wants to select k elements (centers) of  V and an assignment from  V to…”
Get full text

Computing the Largest Bond and the Maximum Connected Cut of a Graph by Duarte, Gabriel L., Eto, Hiroshi, Hanaka, Tesshu, Kobayashi, Yasuaki, Kobayashi, Yusuke, Lokshtanov, Daniel, Pedrosa, Lehilton L. C., Schouery, Rafael C. S., Souza, Uéverton S.

“…The cut-set ∂ ( S ) of a graph G = ( V , E ) is the set of edges that have one endpoint in S ⊂ V and the other endpoint in V \ S , and whenever G [ S ] is…”
Get full text

Approximation algorithms for Median Hub Location Problems by Benedito, Marcelo P. L., Pedrosa, Lehilton L. C.

“…In Hub Location Problems, an input is composed of sets of clients, locations and a pairs of clients; a solution is a subset of locations to open hubs and an…”
Get full text

Approximation algorithms for the bus evacuation problem by Pedrosa, Lehilton L. C., Schouery, Rafael C. S.

“…We consider the bus evacuation problem. Given a positive integer B , a bipartite graph G with parts S and T ∪ { r } in a metric space and functions l i : S → Z…”
Get full text

Polynomial-Time Approximation Schemes for Circle and Other Packing Problems by Miyazawa, Flávio K., Pedrosa, Lehilton L. C., Schouery, Rafael C. S., Sviridenko, Maxim, Wakabayashi, Yoshiko

“…We consider the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height 1…”
Get full text

Approximation algorithms for k-level stochastic facility location problems by Melo, Lucas P., Miyazawa, Flávio K., Pedrosa, Lehilton L. C., Schouery, Rafael C. S.

“…In the k -level facility location problem (FLP), we are given a set of facilities, each associated with one of k levels, and a set of clients. We have to…”
Get full text

On the complexity of the Cable-Trench Problem by Benedito, Marcelo P.L., Pedrosa, Lehilton L.C., Rosado, Hugo K.K.

“…The Cable-Trench Problem (CTP) is a common generalization of the Single-Source Shortest Paths Problem (SSSP) and the Minimum Spanning Tree Problem (MST): given…”
Get full text

Algorithms for the bin packing problem with scenarios by Borges, Yulle G. F., de Lima, Vinícius L., Miyazawa, Flávio K., Pedrosa, Lehilton L. C., de Queiroz, Thiago A., Schouery, Rafael C. S.

“…This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which…”
Get full text

Clustering through Continuous Facility Location Problems by Meira, Luis A.A., Miyazawa, Flávio K., Pedrosa, Lehilton L.C.

“…We consider the Continuous Facility Location Problem (ConFLP). Given a finite set of clients C⊂Rd and a number f∈R+, ConFLP consists in opening a set F′⊂Rd of…”
Get full text

A parameterized approximation algorithm for the Multiple Allocation $k$-Hub Center by Benedito, Marcelo P. L, Melo, Lucas P, Pedrosa, Lehilton L. C

“…In the Multiple Allocation $k$-Hub Center (MA$k$HC), we are given a connected edge-weighted graph $G$, sets of clients $\mathcal{C}$ and hub locations…”
Get full text

Algorithms for the Bin Packing Problem with Scenarios by Borges, Yulle G. F, de Lima, Vinícius L, Miyazawa, Flávio K, Pedrosa, Lehilton L. C, de Queiroz, Thiago A, Schouery, Rafael C. S

“…This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which…”
Get full text

A Polynomial-time Approximation Scheme for the MAXSPACE Advertisement Problem by da Silva, Mauro R.C., Schouery, Rafael C.S., Pedrosa, Lehilton L.C.

“…In the MAXSPACE problem, given a set of ads A, one wants to place a subset A′⊆A into K slots B1, ..., BK of size L. Each ad Ai∈A has a size si and a frequency…”
Get full text

Approximation algorithms for the MAXSPACE advertisement problem by da Silva, Mauro R. C, Pedrosa, Lehilton L. C, Schouery, Rafael C. S

“…$\newcommand{\cala}{\mathcal{A}}$ In MAXSPACE, given a set of ads $\cala$, one wants to schedule a subset ${\cala'\subseteq\cala}$ into $K$ slots ${B_1, \dots,…”
Get full text

Computing the largest bond of a graph by Duarte, Gabriel L, Lokshtanov, Daniel, Pedrosa, Lehilton L. C, Schouery, Rafael C. S, Souza, Uéverton S

“…A bond of a graph $G$ is an inclusion-wise minimal disconnecting set of $G$, i.e., bonds are cut-sets that determine cuts $[S,V\setminus S]$ of $G$ such that…”
Get full text

Itssafe: An Intelligent Transportation System for Improving Safety and Traffic Efficiency by de Souza, Allan M., Pedrosa, Lehilton L. C., Botega, Leonardo C., Villas, Leandro

“…Recently, many cities are facing challenging mobility and safety issues. The former is commonly related to traffic congestion, as a consequence of uncontrolled…”
Get full text

Computing the Largest Bond and the Maximum Connected Cut of a Graph by Duarte, Gabriel L, Eto, Hiroshi, Hanaka, Tesshu, Kobayashi, Yasuaki, Kobayashi, Yusuke, Lokshtanov, Daniel, Pedrosa, Lehilton L. C, Schouery, Rafael C. S, Souza, Uéverton S

“…The cut-set $\partial(S)$ of a graph $G=(V,E)$ is the set of edges that have one endpoint in $S\subset V$ and the other endpoint in $V\setminus S$, and…”
Get full text

Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center by Fernandes, Cristina G, de Paula, Samuel P, Pedrosa, Lehilton L. C

“…In the k-center problem, given a metric space V and a positive integer k, one wants to select k elements (centers) of V and an assignment from V to centers,…”
Get full text