Skills
.Work. You
Rest

approximation-algorithms

Community

Proves NP-hard approximations with certificates.

Education & Research#certificate#knapsack#algorithm-analysis#tsp#np-hard#approximation#vertex-cover
AuthorArcadi4
Version1.0.0
Installs0

System Documentation

What problem does it solve?

Certificate-based audits for approximation guarantees of NP-hard optimization problems, turning heuristic reasoning into provable bounds and verifiable certificates.

Core Features & Use Cases

  • Certificate-based proofs of approximation ratios for problems like vertex cover, set cover, metric TSP, knapsack, and scheduling.
  • Structured proof patterns that separate feasibility, optimality bounds, and ratio chaining to ensure correctness.
  • Use cases include validating claims in CLRS-style exercises, auditing algorithm performance, and documenting formal certificates for published results.

Quick Start

Provide a certificate-based analysis for a specified NP-hard problem instance following the CLRS framework.

Dependency Matrix

Required Modules

None required

Components

Standard package

💻 Claude Code Installation

Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.

Please help me install this Skill:
Name: approximation-algorithms
Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#approximation-algorithms

Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
View Source Repository

Agent Skills Search Helper

Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.