JOURNAL ARTICLE

Approximating the min–max (regret) selecting items problem

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

Benjamin Doerr

Journal:   Information Processing Letters Year: 2013 Vol: 113 (19-21)Pages: 747-749
JOURNAL ARTICLE

A randomized algorithm for the min-max selecting items problem with uncertain weights

Adam KasperskiPaweł Zieliński

Journal:   Annals of Operations Research Year: 2009 Vol: 172 (1)Pages: 221-230
© 2026 ScienceGate Book Chapters — All rights reserved.