Approximating min-max (regret) versions of some polynomial problems

Authors:
Hassene Aissi;Cristina Bazgan;Daniel Vanderpooten
Affiliations:
LAMSADE, Université Paris-Dauphine, France;LAMSADE, Université Paris-Dauphine, France;LAMSADE, Université Paris-Dauphine, France
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 7
Cited 5

Exact arborescences, matchings and cycles

Discrete Applied Mathematics
Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
A combinatorial algorithm for the determinant

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack

ESA'05 Proceedings of the 13th annual European conference on Algorithms
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

Operations Research Letters

Approximating Single Machine Scheduling with Scenarios

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the approximability of minmax (regret) network optimization problems

Information Processing Letters
Exact algorithms for OWA-optimization in multiobjective spanning tree problems

Computers and Operations Research
TACOMA: Server and workload management in internet data centers considering cooling-computing power trade-off and energy proportionality

ACM Transactions on Architecture and Code Optimization (TACO)
Single machine scheduling with scenarios

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies about their approximation. For a bounded number of scenarios, we establish a general approximation scheme which can be used for min-max and min-max regret versions of some polynomial problems. Applying this scheme to shortest path and minimum spanning tree, we obtain fully polynomial-time approximation schemes with much better running times than the ones previously presented in the literature.