Maximum Bounded Rooted-Tree Packing Problem

Details Maximum Bounded Rooted-Tree Packing Problem Maximum Bounded Rooted-Tree Packing Problem

2011-11-03

arxiv.org/abs/1111.0706v1

Computer Science

Computational Complexity

Scientific paper

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 limited outdegree. This problem is motivated by peer-to-peer streaming overlays in under-provisioned systems. We prove that the MBRTP problem is NP-complete. We present two polynomial-time algorithms that computes an optimal solution on complete graphs and trees respectively.

Affiliated with

Also associated with

No associations

Rating

Maximum Bounded Rooted-Tree Packing Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum Bounded Rooted-Tree Packing Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Bounded Rooted-Tree Packing Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-700806