Sciweavers

Share
JNCA
2011
281views more  JNCA 2011»
8 years 1 months ago
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
  Recently, several studies have been conducted to design mobility‐based multicast routing protocols for    wireless mobile ad hoc networks (MANET). These ...
Javad Akbari Torkestani, Mohammad Reza Meybodi
CORR
2011
Springer
159views Education» more  CORR 2011»
8 years 5 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
8 years 8 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
NETWORKS
2010
8 years 8 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
IPL
2002
105views more  IPL 2002»
8 years 10 months ago
Steiner trees in uniformly quasi-bipartite graphs
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
NETWORKS
2006
8 years 10 months ago
Lower bounds for the relative greedy algorithm for approximating Steiner trees
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
Stefan Hougardy, Stefan Kirchner
JUCS
2008
172views more  JUCS 2008»
8 years 10 months ago
A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
CORR
2007
Springer
134views Education» more  CORR 2007»
8 years 10 months ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
COR
2007
108views more  COR 2007»
8 years 10 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
EOR
2008
107views more  EOR 2008»
8 years 10 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...
books