scientific article; zbMATH DE number 895368
From MaRDI portal
Publication:4883380
zbMATH Open0847.90117MaRDI QIDQ4883380FDOQ4883380
Authors: Chih-Long Lin, Ker-I Ko 
Publication date: 26 September 1996
Title of this publication is not available (Why is that?)
Recommendations
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (26)
- Reformulations and complexity of the clique interdiction problem by graph mapping
- Area-time complexity of the unconstrained minimization problem
- Synthesis from component libraries with costs
- Title not available (Why is that?)
- On complexity of the translational-cut algorithm for convex minimax problems
- The maximum clique interdiction problem
- The parameterized complexity of maximality and minimality problems
- Beyond NP: Quantifying over Answer Sets
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- The Exact Computational Complexity of Evolutionarily Stable Strategies
- On the complexity of approximating the VC dimension.
- Title not available (Why is that?)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Complexity of approximating bounded variants of optimization problems
- Network-formation games with regular objectives
- (In)approximability of maximum minimal FVS
- In Memoriam: Ker-I Ko (1950–2018)
- A general framework for evaluating and comparing soft clusterings
- Title not available (Why is that?)
- Local approximability of max-min and min-max linear programs
- Title not available (Why is that?)
- ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION
- On combined minmax-minsum optimization
- HYPER-MINIMIZATION IN O(n2)
- Computational complexity of multi-player evolutionarily stable strategies
- Title not available (Why is that?)
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)
