Algorithms – ESA 2005

DOI10.1007/11561071MaRDI QIDQ5475893zbMATH OpenOpenAlexFDO

Authors Hassene Aissi, Daniel Vanderpooten, Cristina Bazgan

Publication date 27 June 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11561071

zbMATH Keywords

approximationfully polynomial-time approximation schemeknapsackmin-maxmin-max regretminimum spanning treeshortest path

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• Approximating Min-Max (Regret) Versions of Some Polynomial Problems
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• On the approximability of minmax (regret) network optimization problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey

Cited in

(13)

• Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
• Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
• The Complexity of Bottleneck Labeled Graph Problems
• Approximating Min-Max (Regret) Versions of Some Polynomial Problems
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• An s-t connection problem with adaptability
• The complexity of bottleneck labeled graph problems
• Approximating the shortest path problem with scenarios
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Approximating optimization problems in graphs with locational uncertainty
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
• On the approximability of minmax (regret) network optimization problems

This page was built for publication: Algorithms – ESA 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475893)