Improved Approximation for the Directed Spanner Problem

Details Improved Approximation for the Directed Spanner Problem Improved Approximation for the Directed Spanner Problem

2010-12-18

arxiv.org/abs/1012.4062v1

Computer Science

Data Structures and Algorithms

Scientific paper

We prove that the size of the sparsest directed k-spanner of a graph can be
approximated in polynomial time to within a factor of $\tilde{O}(\sqrt{n})$,
for all k >= 3. This improves the $\tilde{O}(n^{2/3})$-approximation recently
shown by Dinitz and Krauthgamer.

Affiliated with

Also associated with

No associations

Rating

Improved Approximation for the Directed Spanner 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 Improved Approximation for the Directed Spanner Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Approximation for the Directed Spanner Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-156940