Algorithms about concept map | Computer Science homework help
The work is to read Chapter 35 and make a concept map for the following topics (skipping the proofs). Make 4 concept maps for below 4 topics. Each concept map should contain most of the key concepts/ideas discussed in the sections.
· Chapter 35 – Approximation Algorithms (skip proofs)
o Content before 35.1
o 35.1 The vertex-cover problem
o 35.2 The traveling-salesman problem
o 35.3 The set-covering problem
Making concept maps to summarize chapter lectures
How to make a concept map?
1. How to make a concept map? (Links to an external site.)