Search Sciweavers | Sciweavers

701 search results - page 14 / 141

» An Ant Algorithm for the Steiner Tree Problem in Graphs

click to vote

FOCS
2004
IEEE

116views Theoretical Computer Science» more FOCS 2004»

An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem

13 years 11 months ago

Download www.cs.toronto.edu

Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...

Lap Chi Lau

claim paper

Read More »

click to vote

JUCS
2008

172views more JUCS 2008»

A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem

13 years 7 months ago

Download www.jucs.org

: 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é...

claim paper

Read More »

click to vote

FOCS
2006
IEEE

186views Theoretical Computer Science» more FOCS 2006»

Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs

14 years 1 months ago

Download www.cse.cuhk.edu.hk

Given an undirected hypergraph and a subset of vertices S ⊆ V with a speciﬁed root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to ﬁnd an orientation of all the...

Tamás Király, Lap Chi Lau

claim paper

Read More »

click to vote

SODA
2008
ACM

73views Algorithms» more SODA 2008»

Set connectivity problems in undirected graphs and the directed Steiner network problem

13 years 8 months ago