Abstract
In this paper, we define four optimization problems according to various topology configurations in VANET. Furthermore, we give the NP-completeness proof for three of these problems, and proof that one is in polynomial time. We proposed two approaches for P-solvable problem, that is, optimal and heuristic approaches. In addition, we gave performance evaluations for all four problems and compared their performance.