Publication | Closed Access

A new lower bound for the list update problem in the partial cost model

Mathematical ProgrammingComputational Complexity TheoryEngineeringList Update ProblemPartial Cost ModelOptimization ProblemAlgorithmic Information TheoryLower BoundAlgorithmic EfficiencyComputational ComplexityNew Lower BoundComputer ScienceDiscrete MathematicsCombinatorial OptimizationApproximation TheoryOperations Research