min-max-min problem
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
... of min-max/min-max regret shortest path, and min-max spanning tree, which are based on the 3-partition problem, cannot be used to establish non-approximability results for ...
12
SEMIDEFINITE PROGRAMMING FOR MIN-MAX PROBLEMS AND GAMES
... can be solved in a polynomial time. This extends Shah and Parrilo [44]. 7. Conclusion We have proposed a common methodology to approximate the optimal value of games in two different contexts. The first algorithm, ...
24
Approximating min-max (regret) versions of some polynomial problems
... then Min-Max Shortest Path and Min-Max Regret Shortest Path can be solved in time O(nmU k ...each problem, an enumeration algorithm based on a dy- namic programming formulation, that ...
10
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
... paradigmatic problem in combinatorial optimization, the min vertex cover ...of max independent set) and ...where max independent set is polynomially ...for max independent set can be ...
26
Complexity of the min-max (regret) versions of cut problems
... the min-max and min-max regret criteria, stemming from decision theory, to construct solutions hedging against parameters ...In min- max optimization, the aim is to find a ...
11
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier
... A. Warmup: Single Threshold The warmup protocol is based on a well-known idea of iteratively eliminating vertices with small degree [4], [6], [8], [13], [15], [17], [23], [28], which can be easily implemented in the ...
12
Max-Min Lyapunov Functions for Switching Differential Inclusions
... DI problem, we introduced a family of nonsmooth functions obtained by max-min ...of max-min functions for state-dependent switching ...a max-min function by checking the ...
7
Differential approximation of MIN SAT, MAX SAT and related problems
... a problem (assume that it is a maximization one) to be approximable within some ratio, by showing the impossibility for the optimal value to be approximated within this ...
16
A MIN-MAX PATH APPROACH FOR BALANCING ROBOTIC ASSEMBLY LINES WITH SEQUENCE-DEPENDENT SETUP TIMES
... Balancing Problem of type 2. The problem is of industrial relevance due to the growing robotization of the assembly lines in the new Industry ...the problem is concerned with addressing three ...
11
Direct-Search for a Class of Stochastic Min-Max Problems
... where ξ is a random variable that captures the ran- domness of the objective function. The origin of the noise could be privacy related, or caused by a noisy adversary. Most commonly, it might arise from on- line ...
12
Differential approximation of MIN SAT, MAX SAT and related problems
... 18. max sat /∈ ...called MAX-NP. A maximiza- tion problem Π ∈ NPO belongs to Max-NP if and only if there exist two finite structures (U, I) and (U, S), a quantifier-free first order formula ϕ and ...
16
Max-Min Lyapunov Functions for Switched Systems and Related Differential Inclusions
... the problem of interest is to construct a Lyapunov function for systems (1) and (2) which guarantees asymptotic stability of the origin {0} ⊂ R n ...Such max-min type of Lyapunov functions were ...
27
The ridge method for tame min-max problems
... results Min-max problems arise in machine learning applications with Generative Adversarial Networks (GANs) [27, 6], adversarial training of deep networks [34, 28], and further applications [1] bolstering ...
29
Relaxation schemes for min max generalization in deterministic batch mode reinforcement learning
... the min max optimization problem introduced in [6] for computing policies for batch mode reinforcement learning in a deterministic ...This problem is ...a problem that is solvable in ...
6
Towards min max generalization in reinforcement learning
... When using batch mode reinforcement learning algorithms to design au- tonomous intelligent agents, a problem arises. After a long enough time of in- teraction with their environment, the sample the agents collect ...
18
A Hölderian backtracking method for min-max and min-min problems
... a min-min problem which satisfies Assumption ...the min-oracle required by our al- gorithm, we use it as an exact ...minimization problem has a unique solution and the corresponding p ...
20
Pseudo-polynomial algorithms for min-max and min-max regret problems
... Keywords: min-max, min-max regret, computational complexity, ...optimization problem requires to specify parameters, in particular objective function coefficients, which may be ...
8
Dirac-Coulomb operators with general charge distribution. I. Distinguished extension and min-max formulas
... There are fewer results about the multi-center case, which is however as physically important as the atomic case. The intuitive picture is that self-adjointness is essentially a local problem at the singularities ...
33
Min/max time limits and energy penalty of communication scheduling in ring-based ONoC
... bring ONoC as a bridge future for communication media in the MPSoC domain. As ONoC can support Wavelength Divi- sion Multiplexing (WDM) technique, communications between cores can be improved through allocation of one or ...
7
A max-min principle for the ground state of the Dirac-Fock functional
... One way to deal with this problem, is to restrict the energy functional to the space + E N , + being the projector on the space of positive states of a perturbed Dirac operator H0 +.. No[r] ...
9