11 citations · 18 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012
Algorithms for Junctions in Directed Acyclic Graphs
Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco
Given a pair of distinct vertices u, v in a graph G, we say that s is a junction of u, v if there are in G internally vertex disjoint directed paths from s to u and from s to v. We…
cs.DS2010★ 11 cited
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira +1
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2-1/(n-1))-approximation for the Prize-Collecting Steiner…