arXiv (All)
open access
Classifying Approximation Algorithms: Understanding the APX Complexity Class
Many NP-hard optimization problems that are equivalent under Karp reductions behave very differently when we ask for polynomial-time approximations. This paper studies the complexity class APX, a subclass of NPO consisting of optimization problems that admit polynomial-time algorithms with constant-
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extending Exact Integrality Gap Computations for the Metric TSP#986210
- Strictly Unfriendly $k$-Partitions: Sharp Degree Thresholds and ETH-Based Lower Bounds#1200091
- Directed Global Minimum Cut in Almost-Linear Time#1247825
- Data-driven Smooth-to-hard Spectral Regularization for General Linear Inverse Problems#1357319
- ADMM and Linearized ADMM for Weakly Convex Minimization#1000133
Record · ID 1402868
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive