A Sufficiency Condition for Graphs to Admit Greedy Algorithm in Solving the Minimum Sum Vertex Cover Problem

Author

Mohan, S. V Rohith ; Acharya, B.D. ; Acharya, M.

Author_Institution

Dept. of Math., Indian Inst. of Technol., Kharagpur, India

fYear

2011

fDate

20-22 July 2011

Firstpage

1

Lastpage

5

Abstract

Minimum sum vertex cover (MSVC) problem is a NP-Complete problem which arises in the context of designing efficient algorithms for solving semi-definite programs, and in the context of speeding up matrix computations. In this paper, in order to solve the MSVC problem, we address a new general problem: Precisely which graphs admit greedy algorithm in solving minimizing minimum sum vertex cover (MSVC) problem? We obtain a sufficiency condition for solving this problem; the graphs satisfying this condition have been called recurrent dominancy regular partition graphs (R-DRPG).

Keywords

computational complexity; graph theory; greedy algorithms; mathematical programming; NP-Complete problem; greedy algorithm; minimum sum vertex cover problem; recurrent dominancy regular partition graphs; semidefinite program; sufficiency condition; Algorithm design and analysis; Approximation algorithms; Approximation methods; Binary trees; Bipartite graph; Greedy algorithms; Labeling;

fLanguage

English

Publisher

ieee

Conference_Titel

Process Automation, Control and Computing (PACC), 2011 International Conference on

Conference_Location

Coimbatore

Print_ISBN

978-1-61284-765-8

Type

conf

DOI

10.1109/PACC.2011.5979021

Filename

5979021