Work

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.
Language: English
Open Access status: green
OpenAlex ID: W55614575
FWCI: 0.428
Cites: 18
Cited by: 199
Related to: 8