Sciweavers

Share
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
9 years 11 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
9 years 11 months ago
Charity auctions on social networks
Arpita Ghosh, Mohammad Mahdian
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
9 years 11 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
9 years 11 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
books