We present a simple proof that the competitive ratio of any randomized online matching algorithm for the line exceeds √log2(n+1)/15 for all n = 2i-1 : i ∈ N, settling a 25-year-old open question
We study the Online Minimum Metric Bipartite Matching Problem. In this problem, we are given point s...
Abstract. We consider the online metric matching problem. In this problem, we are given a graph with...
We study online competitive algorithms for the line chasing problem in Euclidean spaces R^d, where t...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
We prove a lower bound ρ ≥ 9.001 for the competitive ratio of the so-called online matching problem ...
AbstractGiven a set S⊆R of points on the line, we consider the task of matching a sequence (r1,r2,…)...
In online minimum cost matching on the line, n requests appear one by one and have to be matched imm...
In the online metric bipartite matching problem, we are given a set S of server locations in a metri...
We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching proble...
In this thesis we present a randomized online algorithm for the 2-server problem on the line, named ...
We study the minimum-cost metric perfect matching problem under online i.i.d arrivals. We are given ...
We consider the online metric matching problem in which we are given a metric space, k of whose poin...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
AbstractBorodin et al. (1992) introduce a general model for online systems in [3] called task system...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
We study the Online Minimum Metric Bipartite Matching Problem. In this problem, we are given point s...
Abstract. We consider the online metric matching problem. In this problem, we are given a graph with...
We study online competitive algorithms for the line chasing problem in Euclidean spaces R^d, where t...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
We prove a lower bound ρ ≥ 9.001 for the competitive ratio of the so-called online matching problem ...
AbstractGiven a set S⊆R of points on the line, we consider the task of matching a sequence (r1,r2,…)...
In online minimum cost matching on the line, n requests appear one by one and have to be matched imm...
In the online metric bipartite matching problem, we are given a set S of server locations in a metri...
We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching proble...
In this thesis we present a randomized online algorithm for the 2-server problem on the line, named ...
We study the minimum-cost metric perfect matching problem under online i.i.d arrivals. We are given ...
We consider the online metric matching problem in which we are given a metric space, k of whose poin...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
AbstractBorodin et al. (1992) introduce a general model for online systems in [3] called task system...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
We study the Online Minimum Metric Bipartite Matching Problem. In this problem, we are given point s...
Abstract. We consider the online metric matching problem. In this problem, we are given a graph with...
We study online competitive algorithms for the line chasing problem in Euclidean spaces R^d, where t...
DOI
Add to ORKG