Search Sciweavers | Sciweavers

291 search results - page 1 / 59

» Factor 2 Approximation Algorithm for the Generalized Steiner...

click to vote

FOCS
1998
IEEE

81views Theoretical Computer Science» more FOCS 1998»

Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

13 years 9 months ago

Download www.ccs.neu.edu

Kamal Jain

claim paper

Read More »

click to vote

SODA
2010
ACM

215views Algorithms» more SODA 2010»

Approximability of Robust Network Design

14 years 2 months ago

Download www.math.mcgill.ca

We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...

Neil Olver, F. Bruce Shepherd

claim paper

Read More »

click to vote

COCOON
2005
Springer

132views Combinatorics» more COCOON 2005»

Algorithms for Terminal Steiner Trees

13 years 10 months ago

Download www.ime.usp.br

The terminal Steiner tree problem (TST) consists of ﬁnding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...

Fábio Viduani Martinez, José Coelho ...

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

13 years 11 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

FOCS
2009
IEEE

163views Theoretical Computer Science» more FOCS 2009»

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

13 years 11 months ago

Download www.openu.ac.il

Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph

Zeev Nutov

claim paper