Complexity of the min-max (regret) versions of cut problems

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

Concerning the strain-specific response to growth in shrimp juice, 19 genes encoding proteins of unknown function were upregulated in CD337 only, among which 6 were absent from

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

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

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

Dies beinhaltet aber faktisch, daß τρόπος τής ύπάρξεως nicht nur auf den Sohn angewendet wird, sondern auch auf den Vater, mindestens in indirekter Weise (vgl..