Algorithms – ESA 2005
From MaRDI portal
Publication:5475893
DOI10.1007/11561071zbMath1142.68608OpenAlexW2501059503MaRDI QIDQ5475893
Daniel Vanderpooten, Hassene Aissi, 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
shortest pathapproximationminimum spanning treeknapsackmin-maxmin-max regretfully polynomial-time approximation scheme
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
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, Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis), The Complexity of Bottleneck Labeled Graph Problems, Robust combinatorial optimization under convex and discrete cost uncertainty, An \(s\)-\(t\) connection problem with adaptability, On the approximability of minmax (regret) network optimization problems, The complexity of bottleneck labeled graph problems
