scientific article; zbMATH DE number 65698

MaRDI QIDQ4010309zbMATH OpenFDO

Authors Prabhakar Raghavan

Publication date 27 September 1992

zbMATH Keywords

competitivenesson-line algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(15)

• Measuring the problem-relevant information in input
• Online Vehicle Routing Problems: A Survey
• Online-bounded analysis
• An improvement on El-Yaniv-Fiat-Karp-Turpin's money-making bi-directional trading strategy
• Online graph coloring against a randomized adversary
• Evaluating the quality of online optimization algorithms by discrete event simulation
• The relative worst-order ratio applied to paging
• Delayed information and action in on-line algorithms
• Online network design with outliers
• Online bounded analysis
• Relative Worst-Order Analysis: A Survey
• On the on-line rent-or-buy problem in probabilistic environments
• Scheduling with machine cost and rejection
• The K-server problem via a modern optimization lens
• Optimal online edge coloring of planar graphs with advice

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010309)