Stability of Approximation in Discrete Optimization
From MaRDI portal
Recommendations
- Stability of approximation algorithms or parameterization of the approximation ratio
- Stability of approximation algorithms for hard optimization problems
- Are stable instances easy?
- A Modern View on Stability of Approximation
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Cited in
(12)- Stability of separable discrete optimization problems
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Stability analysis of some discrete optimization algorithms
- Stability and regularization for determining sets of discrete Laplacian
- Are stable instances easy?
- Sub-optimality Approximations
- Stability of approximation algorithms for hard optimization problems
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
- Regions of stability for nonlinear discrete optimization problems
- Approximation Stability and Proxy Objectives
- Stability of approximation algorithms or parameterization of the approximation ratio
- A Modern View on Stability of Approximation
This page was built for publication: Stability of Approximation in Discrete Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673386)