scientific article; zbMATH DE number 895368
From MaRDI portal
Publication:4883380
Recommendations
Cited in
(27)- scientific article; zbMATH DE number 1407504 (Why is no real title available?)
- Area-time complexity of the unconstrained minimization problem
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Synthesis from component libraries with costs
- scientific article; zbMATH DE number 1138438 (Why is no real title available?)
- On complexity of the translational-cut algorithm for convex minimax problems
- The maximum clique interdiction problem
- The parameterized complexity of maximality and minimality problems
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- Complexity of near-optimal robust versions of multilevel optimization problems
- On the complexity of approximating the VC dimension.
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- scientific article; zbMATH DE number 3869007 (Why is no real title available?)
- Complexity of approximating bounded variants of optimization problems
- Network-formation games with regular objectives
- (In)approximability of maximum minimal FVS
- Beyond NP: quantifying over answer sets
- In Memoriam: Ker-I Ko (1950–2018)
- Reconstructing sets of strings from their k-way projections: algorithms \& complexity (extended abstract)
- scientific article; zbMATH DE number 3849019 (Why is no real title available?)
- A general framework for evaluating and comparing soft clusterings
- Local approximability of max-min and min-max linear programs
- scientific article; zbMATH DE number 1842063 (Why is no real title available?)
- On combined minmax-minsum optimization
- ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION
- HYPER-MINIMIZATION IN O(n2)
- Computational complexity of multi-player evolutionarily stable strategies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883380)
