Online algorithms: A study of graph-theoretic concepts

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graph-theoretic concepts have proven particularly useful in the formulation or in the solution of the problem.For each of the problems addressed, we also present important open questions.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 25th International Workshop, WG 1999, Proceedings
EditorsPeter Widmayer, Gabriele Neyer, Stephan Eidenbenz
PublisherSpringer Verlag
Pages10-26
Number of pages17
ISBN (Print)3540667318, 9783540667315
DOIs
StatePublished - 1999
Externally publishedYes
Event25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999 - Ascona, Switzerland
Duration: 17 Jun 199919 Jun 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1665
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999
Country/TerritorySwitzerland
CityAscona
Period17/06/9919/06/99

Fingerprint

Dive into the research topics of 'Online algorithms: A study of graph-theoretic concepts'. Together they form a unique fingerprint.

Cite this