On the performance of on-line algorithms for partition problems
Year: 1989
Type: article
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.
Source: Acta Cybernetica
DOI: 10.5555/71777.71779
Authors: Ulrich Faigle, Walter Kern, G. Turán
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W55614575
