Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
17
click to vote
DAM
2006
favorite
Email
discuss
report
75
views
more
DAM 2006
»
A greedy approximation algorithm for the group Steiner problem
13 years 8 months ago
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
more »
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)
Researcher Info
DAM 2010 Study Group
Computer Vision