Amortized efficiency of list update and paging rules
Communications of the ACM
Approximation algorithms for NP-hard problems
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
On-line paging against adversarially biased random inputs
Journal of Algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
SIAM Journal on Computing
The Dynamic and Stochastic Knapsack Problem
Operations Research
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Adaptive limited-supply online auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Hi-index | 0.01 |
In a classical online network design problem, traffic requirements are gradually revealed to an algorithm. Each time a new request arrives, the algorithm has to satisfy it by augmenting the network under construction in a proper way (with no possibility of recovery). In this paper we study a natural generalization of the problems above, where a fraction of the requests (the outliers) can be disregarded. Now, each time a request arrives, the algorithm first decides whether to satisfy it or not, and only in the first case it acts accordingly; in the end at least k out of t requests must be selected. We cast three classical network design problems into this framework, the Online Steiner Tree with Outliers, the Online TSP with Outliers, and the Online Facility Location with Outliers. We focus on the known distribution model, where terminals are independently sampled from a given distribution. For all the above problems, we present bicriteria online algorithms that, for any constant ε 0, select at least (1-ε)k terminals with high probability and pay in expectation O(log2n) times more than the expected cost of the optimal offline solution (selecting k terminals). These upper bounds are complemented by inapproximability results.