Stability of approximation algorithms or parameterization of the approximation ratio
From MaRDI portal
Recommendations
- Stability of Approximation in Discrete Optimization
- A Modern View on Stability of Approximation
- Stability of approximation algorithms for hard optimization problems
- Are stable instances easy?
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
Cited in
(10)- On the approximation ratio of the path matching Christofides algorithm
- Improved approximations for hard optimization problems via problem instance classification
- On stability of Oja algorithm
- Stability of approximation algorithms for hard optimization problems
- Stability of Approximation in Discrete Optimization
- Stability of approximation algorithms and the knapsack problem
- Approximation Stability and Proxy Objectives
- scientific article; zbMATH DE number 7307480 (Why is no real title available?)
- A Modern View on Stability of Approximation
- On the stability of a two-sided sweep algorithm
This page was built for publication: Stability of approximation algorithms or parameterization of the approximation ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5446938)