Pages that link to "Approximation algorithm"
Jump to navigation
Jump to search
The following pages link to Approximation algorithm:
Displaying 37 items.
- Algorithm (← links)
- Boolean satisfiability problem (← links)
- Knapsack problem (← links)
- NP (complexity) (← links)
- Travelling salesman problem (← links)
- Subset sum problem (← links)
- Linear programming (← links)
- NP-hardness (← links)
- System on a chip (← links)
- Assignment problem (← links)
- Line drawing algorithm (← links)
- Tree decomposition (← links)
- Interactive proof system (← links)
- Permanent (mathematics) (← links)
- Ronald Graham (← links)
- Clique problem (← links)
- Bin packing problem (← links)
- Local search (optimization) (← links)
- List of computability and complexity topics (← links)
- Time complexity (← links)
- Levenshtein distance (← links)
- Kissing number (← links)
- Bottleneck traveling salesman problem (← links)
- Combinatorial optimization (← links)
- Graph coloring (← links)
- 15 puzzle (← links)
- 2-satisfiability (← links)
- Steiner tree problem (← links)
- Complexity class (← links)
- Independent set (graph theory) (← links)
- Vertex cover (← links)
- Matching (graph theory) (← links)
- Parameterized complexity (← links)
- List of algorithm general topics (← links)
- Polynomial-time approximation scheme (← links)
- Perfect graph (← links)
- List of terms relating to algorithms and data structures (← links)