4.7 Editorial Material

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

Journal

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 290, Issue 1, Pages 401-403

Publisher

ELSEVIER
DOI: 10.1016/j.ejor.2020.07.047

Keywords

Combinatorial optimization; Greedy algorithm; Matroid theory

Funding

  1. European Union ERC

Ask authors/readers for more resources

We provide a counterexample to the performance guarantee of a greedy algorithm for minimizing a supermodular set function as claimed in the paper by Il'ev and Linker in 2006, and identify the origin of this error in the proof of the main theorem.
We provide a counterexample to the performance guarantee obtained in the paper Il'ev, V., Linker, N., 2006. Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid, which was published in Volume 171 of the European Journal of Operational Research. We point out where this error originates from in the proof of the main theorem. (C) 2020 The Author(s). Published by Elsevier B.V.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available