The complexity of meshes in computer graphics rendering algorithms like ray tracing hinders the performance of these algorithms. Therefore, the need arises for reduced and approximated mesh quality and at the same time preserving the salient features of the shape. Mesh simplification problem in some cases can be considered as initial value problem where the quality of simplified mesh heavily depends on initial selection of vertices for contraction. In this short paper, we present an ongoing work in mesh simplification that uses a greedy algorithm for minimum vertex cover problem in order to select vertex contraction pairs to preserve salient features in the simplified mesh. Initial experiments show promising results with preserved salient features.