L. L. Pedrosa

activity

20112026

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020

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

Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka +6

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 ∖ S$ , and whenever $G [S]$ is connected…

cs.DS2020

Approximation algorithms for the MAXSPACE advertisement problem

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

In MAXSPACE, given a set of ads $\cala$, one wants to schedule a subset ${\cala'\subseteq\cala}$ into $K$ slots $B_{1}, \dots, B_{K}$ of size $L$ . E…