On-line vertex-covering
type: Item
instance of: scholarly article
title: On-line vertex-covering
zbMATH Open document ID: 1070.68118
author: Vangelis Th. Paschos
author: Marc Demange
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2153180
zbMATH Keywords: On-line algorithm
zbMATH Keywords: Competitive ratio
zbMATH Keywords: Approximation
zbMATH Keywords: Graph
zbMATH Keywords: Vertex-covering
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.08.015
OpenAlex ID: W2076855469
cites work: Algorithms for the on-line travelling salesman
cites work: Q3221758
cites work: Q3941433
cites work: Q4471994
cites work: Q4230356
cites work: Online algorithms. The state of the art
cites work: On-line and first fit colorings of graphs
cites work: Online independent sets.
cites work: Lower bounds for on-line graph coloring
cites work: An on-line graph coloring algorithm with sublinear performance ratio
DOI: 10.1016/J.TCS.2004.08.015
description: scientific article; zbMATH DE number 2153180