We prove a lower bound $\rho \geq 9.001$ for the competitive ratio of the so-called online matching problem on a line. As a consequence, the online matching problem is revealed to be strictly more difficult than the ``cow problem''
We introduce and study online versions of weighted matching problems in metric spaces. We present a ...
We study the online strip packing problem and derive an improved lower bound of rho a parts per thou...
We study the online strip packing problem and derive an improved lower bound of ρ ≥ 2.589... for the...
We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching proble...
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,…)...
We revisit the fully online matching model (Huang et al., 2020), an extension of the classic online ...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
In an online problem, the input is revealed one piece at a time. In every time step, the online algo...
We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective o...
This note presents a lower bound of $3/2+\sqrt{33}/6 \approx 2.457$ on the competitive ratio for onl...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
In online minimum cost matching on the line, n requests appear one by one and have to be matched imm...
We consider online scheduling of parallel jobs on parallel machines. For the problem with two machin...
We introduce and study online versions of weighted matching problems in metric spaces. We present a ...
We study the online strip packing problem and derive an improved lower bound of rho a parts per thou...
We study the online strip packing problem and derive an improved lower bound of ρ ≥ 2.589... for the...
We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching proble...
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,…)...
We revisit the fully online matching model (Huang et al., 2020), an extension of the classic online ...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
In an online problem, the input is revealed one piece at a time. In every time step, the online algo...
We consider online scheduling on multiple machines for jobs arriving one-by-one with the objective o...
This note presents a lower bound of $3/2+\sqrt{33}/6 \approx 2.457$ on the competitive ratio for onl...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
In online minimum cost matching on the line, n requests appear one by one and have to be matched imm...
We consider online scheduling of parallel jobs on parallel machines. For the problem with two machin...
We introduce and study online versions of weighted matching problems in metric spaces. We present a ...
We study the online strip packing problem and derive an improved lower bound of rho a parts per thou...
We study the online strip packing problem and derive an improved lower bound of ρ ≥ 2.589... for the...
DOI
Add to ORKG