Some efficient algorithms for the k-vertex cover problem Yijia Chen Shanghai Jiao Tong University July 8,2021@Nanjing
Some efficient algorithms for the k-vertex cover problem Yijia Chen Shanghai Jiao Tong University July 8, 2021 @ Nanjing
The goal of this talk 1.Show you an interesting(I hope)problem. 2.Show some simple yet non-trivial algorithms. 3.Show a nontrivial application of linear programming. 4.Present a parallel algorithm using logic and number theory
The goal of this talk 1. Show you an interesting (I hope) problem. 2. Show some simple yet non-trivial algorithms. 3. Show a nontrivial application of linear programming. 4. Present a parallel algorithm using logic and number theory
The CCTV problem CAN WE INSTALL AT MOST 10000 CCTV (CLOSED-CIRCUIT TELEVI- SION)CAMERAS SO THAT EVERY STREET IN NANJING IS COVERED?
The CCTV problem Can we install at most 10000 CCTV (closed-circuit television) cameras so that every street in Nanjing is covered?
Modelling the CCTV problem
Modelling the CCTV problem
Modelling the CCTV problem
Modelling the CCTV problem