Search Sciweavers | Sciweavers

701 search results - page 15 / 141

» An Ant Algorithm for the Steiner Tree Problem in Graphs

Voted

NETWORKS
1998

49views Computer Networks» more NETWORKS 1998»

A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs

15 years 3 months ago

Download www.cs.kent.edu

Andreas Brandstädt, Feodor F. Dragan

claim paper

Read More »

103

click to vote

WG
2001
Springer

93views Theoretical Computer Science» more WG 2001»

Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

15 years 8 months ago

Download www.alice-dsl.net

Clemens Gröpl, Stefan Hougardy, Till Nierhoff...

claim paper

Read More »

113

click to vote

JISE
2006

107views more JISE 2006»

FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem

15 years 3 months ago

Download www.iis.sinica.edu.tw

Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai

claim paper

Read More »

107

Voted

CIAC
2006
Springer

131views Algorithms» more CIAC 2006»

Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems

15 years 7 months ago

Download macs.cs.cityu.edu.hk

Erez Kantor, David Peleg

claim paper

Read More »

121

Voted

JCO
2008

117views more JCO 2008»

Approximation algorithms for connected facility location problems

15 years 3 months ago

Download tclab.kaist.ac.kr

We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...

Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...

claim paper

Read More »

« Prev « First page 15 / 141 Last » Next »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers