Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid
 
research article

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

Karaca, Orcun
•
Guo, Baiwei  
•
Kamgarpour, Maryam  
April 1, 2021
European Journal Of Operational Research

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.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1016/j.ejor.2020.07.047
Web of Science ID

WOS:000600670300027

Author(s)
Karaca, Orcun
Guo, Baiwei  
Kamgarpour, Maryam  
Date Issued

2021-04-01

Publisher

ELSEVIER

Published in
European Journal Of Operational Research
Volume

290

Issue

1

Start page

401

End page

403

Subjects

Management

•

Operations Research & Management Science

•

Business & Economics

•

combinatorial optimization

•

greedy algorithm

•

matroid theory

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LA  
Available on Infoscience
March 26, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/176407
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés