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

The main objective of this paper is three-fold: (i) to investigate under which additional assumptions on the data of these problems, the unique solutions of systems (1.1) and

The user interface provides the listener with the capability to alternately bring one stream into auditory focus by increasing its relative gain and makes it easy for

reduction for computing the parity of the k-clique count that only requires a constant bound on the error probability (for each fixed k) of the blackbox algorithm solving the problem

Nevertheless, the quality of lower bounds produced from set covering based formulations for single objective VRPs are one the best and so we can expect good quality lower bounds

APX or DAPX: the class of problems for which there exists a polynomial algorithm achieving standard or differential approximation ratio f ( | x | ) where function f is constant (it

Revisit Proposition 5 and remark that if m < (log 1.5874/ log 3)opt(G) ≈ 0.42opt(G), then the parameterized algorithm of Proposition 5 runs faster than that of Proposition 4

In this paper, we investigate the parameterized complexity of these two graph problems by consider- ing several parameters, such as the value p of the solution, k, the size τ of

Pierre Kunz, géologue, nous rejoint et nous empruntons alors le chemin menant au secteur entièrement aménagé par l’Association des Amis des Granges et du Biolley ( AAGB ) dans