Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights

ACM Transactions on Algorithms (TALG), Volume 13, Issue 3, 2017.

Cited by: 3|Bibtex|Views13|Links
EI
Keywords:
approximation algorithms

Abstract:

In the Steiner k-Forest problem, we are given an edge weighted graph, a collection D of node pairs, and an integer k ⩽ |D|. The goal is to find a min-weight subgraph that connects at least k pairs. The best known ratio for this problem is min {O(&sqrt;n), O(&sqrt;k)} [Gupta et al. 2010]. In Gupta et al. [20...More

Code:

Data:

Your rating :
0

 

Tags
Comments