2 citations · 8 across the 8 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016★ 1 cited
Finding long simple paths in a weighted digraph using pseudo-topological orderings
Miguel Raggi
Given a weighted digraph D, finding the longest simple path is well known to be NP-hard. Furthermore, even giving an approximation algorithm is known to be NP-hard. In this paper w…
math.CO2016★ 2 cited
A note on the tolerated Tverberg theorem
Natalia García-Colín, Miguel Raggi, Edgardo Roldán-Pensado
In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain…