Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

DAM
2006

favoriteEmaildiscussreport

75views more DAM 2006»

A greedy approximation algorithm for the group Steiner problem

13 years 11 months ago

A greedy approximation algorithm for the group Steiner problem

Download www-math.mit.edu

Chandra Chekuri, Guy Even, Guy Kortsarz

Real-time Traffic

DAM 2006 |

claim paper

Related Content

» Lower bounds for the relative greedy algorithm for approximating Steiner trees

» On the Covering Steiner Problem

» A GroupStrategyproof Cost Sharing Mechanism for the Steiner Forest Game

» Approximation Algorithms for Euclidean Group TSP

» NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs

» A PartitionBased Relaxation For Steiner Trees

» Approximating FaultTolerant GroupSteiner Problems

» Integrality ratio for group Steiner trees and directed steiner trees

» Analysis of greedy approximations with nonsubmodular potential functions

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DAM
Authors	Chandra Chekuri, Guy Even, Guy Kortsarz

Comments (0)