Sciweavers

632 search results - page 7 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
DAC
2001
ACM
14 years 8 months ago
Creating and Exploiting Flexibility in Steiner Trees
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
Elaheh Bozorgzadeh, Ryan Kastner, Majid Sarrafzade...
COR
2007
108views more  COR 2007»
13 years 7 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
13 years 8 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
EVOW
2007
Springer
14 years 1 months ago
An Ant Algorithm for the Steiner Tree Problem in Graphs
The Steiner Tree Problem (STP) in graphs is a well-known
Luc Luyet, Sacha Varone, Nicolas Zufferey
EOR
2008
107views more  EOR 2008»
13 years 7 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...