Sciweavers

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

6

EVOW
2007
Springer

favoriteEmaildiscussreport

140views Artificial Intelligence» more EVOW 2007»

An Ant Algorithm for the Steiner Tree Problem in Graphs

13 years 10 months ago

An Ant Algorithm for the Steiner Tree Problem in Graphs

Download doc.rero.ch

The Steiner Tree Problem (STP) in graphs is a well-known

Luc Luyet, Sacha Varone, Nicolas Zufferey

Real-time Traffic

Artificial Intelligence | EVOW 2007 | Steiner Tree Problem |

claim paper

Related Content

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs

» Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

» A PartitionBased Relaxation For Steiner Trees

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

» A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

» A GroupStrategyproof Cost Sharing Mechanism for the Steiner Forest Game

» On the Covering Steiner Problem

» Integrality ratio for group Steiner trees and directed steiner trees

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	EVOW
Authors	Luc Luyet, Sacha Varone, Nicolas Zufferey

Comments (0)