Sciweavers

447 search results - page 16 / 90
» Approximation Algorithms for Directed Steiner Problems
Sort
View
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
15 years 2 months ago
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
MohammadHossein Bateni, Julia Chuzhoy
STOC
2007
ACM
154views Algorithms» more  STOC 2007»
16 years 1 months ago
Improved approximation for directed cut problems
Amit Agarwal, Noga Alon, Moses Charikar
APPROX
2007
Springer
87views Algorithms» more  APPROX 2007»
15 years 5 months ago
Stochastic Steiner Tree with Non-uniform Inflation
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar