Competitive analysis (online algorithm)

Known as: Competitive analysis, Competitive ratio 
Competitive analysis is a method invented for analyzing online algorithms, in which the performance of an online algorithm (which must satisfy an… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
The rapid growth in demand for computational power driven by modern service applications combined with the shift to the Cloud… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We study a wide range of online covering and packing optimization problems. In an online covering problem, a linear cost function… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In the classical secretary problem, a set S of numbers is presented to an online algorithm in random order. At any time the… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper discusses online power-aware routing in large wireless ad-hoc networks for applications where the message sequence is… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1996
Highly Cited
1996
The goal of approximating metric spaces by more simple metric spaces has led to the notion of graph spanners PU89, PS89] and to… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server… (More)
Is this relevant?