Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for server problems
Journal of Algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
On-line paging against adversarially biased random inputs
Journal of Algorithms
SIAM Journal on Computing
SIAM Journal on Computing
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Designing Networks Incrementally
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Sampling bounds for stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Average-Case Competitive Analyses for One-Way Trading
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A constant approximation algorithm for the a priori traveling salesman problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Online network design with outliers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Average-case competitive analyses for one-way trading
Journal of Combinatorial Optimization
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Price fluctuations: to buy or to rent
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Hi-index | 0.00 |
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been studied for online problems like paging and k-server, it is not known how to beat the Φ(log n) bound for online Steiner tree if at each time instant, the demand vertex is a uniformly random vertex from the graph. For the online Steiner tree problem, we show that if each demand vertex is an independent draw from some probability distribution π: V → [0, 1], a variant of the natural greedy algorithm achieves Eω[A(ω)]/Eω[OPT (ω)] = O(1); moreover, this result can be extended to some other subadditive problems. Both assumptions that the input sequence consists of independent draws from π, and that π is known to the algorithm are both essential; we show (almost) logarithmic lower bounds if either assumption is violated. Moreover, we give preliminary results on extending the Steiner tree results above to the related "expected ratio" measure Eω[ω(ω)/OPT (ω)]. Finally, we use these ideas to give an average-case analysis of the Universal TSP problem.