Sciweavers

447 search results - page 16 / 90
» Approximation Algorithms for Directed Steiner Problems
Sort
View
157
Voted
APPROX
2010
Springer
193views Algorithms» more  APPROX 2010»
15 years 7 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
125
Voted
APPROX
2007
Springer
106views Algorithms» more  APPROX 2007»
15 years 12 months ago
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
Viswanath Nagarajan, R. Ravi
115
Voted
ICALP
2003
Springer
15 years 11 months ago
Approximation Algorithm for Directed Telephone Multicast Problem
Michael Elkin, Guy Kortsarz
STOC
2007
ACM
154views Algorithms» more  STOC 2007»
16 years 6 months ago
Improved approximation for directed cut problems
Amit Agarwal, Noga Alon, Moses Charikar
134
Voted
APPROX
2007
Springer
87views Algorithms» more  APPROX 2007»
15 years 9 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