1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CC2011★ 1 cited
Maximum Bounded Rooted-Tree Packing Problem
Herve Kerivin, Jimmy Leblet, Gwendal Simon +1
Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a li…
cs.DS2009★ 1 cited
A note on the data-driven capacity of P2P networks
Jacob Chakareski, Pascal Frossard, Hervé Kerivin +2
We consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths…