JOURNAL ARTICLE
Approximating the min–max (regret) selecting items problem
Kasperski, AdamKurpisz, Adam AndrzejZieliński, Paweł
Year: 2013 Journal: BFH: ARBOR
Keywords:
Regret Matroid Set (abstract data type) Base (topology) Constant (computer programming) Approximation algorithm
Metrics
0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
0
Refs
0.30
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Bacillus and Francisella bacterial research
Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology
Biochemical and Structural Characterization
Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology
Bacterial Genetics and Biotechnology
Life Sciences → Biochemistry, Genetics and Molecular Biology → Genetics
Related Documents
JOURNAL ARTICLE
Approximating the min–max (regret) selecting items problem
Adam KasperskiAdam KurpiszPaweł Zieliński
Journal: Information Processing Letters Year: 2012 Vol: 113 (1-2)Pages: 23-29
JOURNAL ARTICLE
Improved approximation algorithms for the Min–Max Selecting Items problem
Journal: Information Processing Letters Year: 2013 Vol: 113 (19-21)Pages: 747-749
BOOK-CHAPTER
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Hassène AissiCristina BazganDaniel Vanderpooten
Lecture notes in computer science Year: 2006 Pages: 428-438
JOURNAL ARTICLE
Min–max and min–max (relative) regret approaches to representatives selection problem
Alexandre DolguiSergey Kovalev
Journal: 4OR Year: 2012 Vol: 10 (2)Pages: 181-192
JOURNAL ARTICLE
A randomized algorithm for the min-max selecting items problem with uncertain weights
Journal: Annals of Operations Research Year: 2009 Vol: 172 (1)Pages: 221-230