# On the performance of on-line algorithms for partition problems

Faigle, Ulrich and Kern, Walter and TurĂ¡n, Gyorgy
(1989)
*On the performance of on-line algorithms for partition problems.*
**Published in: **
Acta Cybernetica : forum centrale publicationum cyberneticarum Hungaricum Vol. 9 (2).
pp. 107-119.

## Abstract

We consider the performance of the greedy algorithm and of on-line algorithms for partition problems in combinatorial optimization. After surveying known resuls we give bounds for matroid and graph partitioning, and discuss the power of non-adaptive adversaries for proving lower bounds.

Actions:

Content information:

Deposit Information:

ZAIK Number: | [error in script] |
---|---|

Depositing User: | Prof. Dr. Ulrich Faigle |

Date Deposited: | 02 Apr 2001 00:00 |

Last Modified: | 09 Jan 2012 11:43 |

URI: | http://e-archive.informatik.uni-koeln.de/id/eprint/66 |