Q5092366 (Q5092366): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 16:43, 29 July 2024

scientific article; zbMATH DE number 7561652

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561652

Statements

scholarly article

0 references

Marcin Bienkowski

0 references

0 references

Christian Coester

0 references

0 references

Elias Koutsoupias

0 references

0 references

publication date

21 July 2022

0 references

full work available at URL

https://arxiv.org/abs/1811.09233

0 references

zbMATH Keywords

convex body chasing

0 references

line chasing

0 references

competitive analysis

0 references

MaRDI profile type

MaRDI publication profile

0 references

Chasing Convex Bodies and Functions

0 references

A Nearly-Linear Bound for Chasing Nested Convex Bodies

0 references

0 references

A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs

0 references

An optimal on-line algorithm for metrical task system

0 references

Competitively chasing convex bodies

0 references

Traversing Layered Graphs Using the Work Function Algorithm

0 references

Competitive Algorithms for Layered Graph Traversal

0 references

On convex body chasing

0 references

On the <i>k</i> -server conjecture

0 references

Competitive algorithms for server problems

0 references

On Traversing Layered Graphs On-Line

0 references

The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem

0 references

Identifiers

10.4230/LIPIcs.MFCS.2019.8

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5092366

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5092366&oldid=36833180"