Search Sciweavers | Sciweavers

107 search results - page 3 / 22

» Prize-Collecting Steiner Network Problems

click to vote

SAINT
2008
IEEE

133views Internet Technology» more SAINT 2008»

Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

14 years 16 days ago

Download www.ads.tuwien.ac.at

We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...

Markus Leitner, Günther R. Raidl

claim paper

Read More »

click to vote

ENDM
2010

101views more ENDM 2010»

Strong Lower Bounds for a Survivable Network Design Problem

13 years 6 months ago

Download www.ads.tuwien.ac.at

We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...

Markus Leitner, Günther R. Raidl

claim paper

Read More »

click to vote

SODA
2001
ACM

150views Algorithms» more SODA 2001»

A faster implementation of the Goemans-Williamson clustering algorithm

13 years 7 months ago

Download www.hariharan-ramesh.com

We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...

Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...

claim paper

Read More »

click to vote

NETWORKS
1998

59views Computer Networks» more NETWORKS 1998»

Solving Steiner tree problems in graphs to optimality

13 years 5 months ago