Amortized efficiency of list update and paging rules
Communications of the ACM
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
Lower bounds for on-line graph coloring
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Approximation algorithms for NP-hard problems
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Graphs and Hypergraphs
A better list heuristic for vertex cover
Information Processing Letters
Mean analysis of an online algorithm for the vertex cover problem
Information Processing Letters
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
| Hi-index | 5.23 |
We study the minimum vertex-covering problem under two on-line models corresponding to two different ways vertices are revealed. The former one implies that the input-graph is revealed vertex-by-vertex. The second model implies that the input-graph is revealed per clusters, i.e. per induced subgraphs of the final graph. Under the cluster-model, we then relax the constraint that the choice of the part of the final solution dealing with each cluster has to be irrevocable, by allowing backtracking. We assume that one can change decisions upon a vertex membership of the final solution, this change implying, however, some cost depending on the number of the vertices changed.