Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comput Sci Technol

Search In Journal Title:

Abbravation: Journal of Computer Science and Technology

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/1058-9139(92)90012-2

Search In DOI:

ISSN

1860-4749

Search In ISSN:
Search In Title Of Papers:

Approximation Algorithm Based on Chain Implication

Authors: JianXin Wang XiaoShuang Xu JianEr Chen
Publish Date: 2008/11/03
Volume: 23, Issue: 5, Pages: 763-768
PDF Link

Abstract

The constrained minimum vertex cover problem on bipartite graphs the MinCVCB problem is an important NPcomplete problem This paper presents a polynomial time approximation algorithm for the problem based on the technique of chain implication For any given constant ɛ  0 if an instance of the MinCVCB problem has a minimum vertex cover of size k u k l our algorithm constructs a vertex cover of size k u k l satisfying max k u /k u k l /k l  ≤ 1 + ɛThis work is supported by the National Natural Science Foundation of China under Grant Nos 60433020 and 60773111 the National Basic Research 973 Program of China under Grant No 2008CB317107 the Provincial Natural Science Foundation of Hunan under Grant No 06JJ10009 the Program for New Century Excellent Talents in University under Grant No NCET050683 and the Program for Changjiang Scholars and Innovative Research Team in University under Grant No IRT0661


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: