Stability of Approximation in Discrete Optimization

DOI10.1007/1-4020-8141-3_2MaRDI QIDQ4673386zbMATH OpenOpenAlexFDO

Authors Juraj Hromkovič

Publication date 29 April 2005

Published in IFIP International Federation for Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/1-4020-8141-3_2

zbMATH Keywords

discrete optimization, parametric optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Stability of approximation algorithms or parameterization of the approximation ratio
• scientific article; zbMATH DE number 1489999
• 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
• scientific article; zbMATH DE number 1489999 (Why is no real title available?)
• scientific article; zbMATH DE number 1507218 (Why is no real title available?)
• scientific article; zbMATH DE number 2159165 (Why is no real title available?)
• 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)