A better list heuristic for vertex cover

Information Processing Letters

Volumn 107, Issue 3-4, 2008, Pages 125-127

  Delbot, François ^a   Laforest, Christian ^a  

^a UNIVERSITY OF EVRY   (France)

Author keywords

Analysis of algorithms; Graph algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; ONLINE SYSTEMS;

GRAPH ALGORITHMS; ONLINE ALGORITHM; VERTEX COVER;

HEURISTIC METHODS;

EID: 44649131261     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.02.004     Document Type: Article

References (6)

1. Avis D., and Imamura T. A list heuristic for vertex cover. Oper. Res. Lett. 35 (2006) 201-204
2. Demange M., and Paschos V.Th. On-line vertex-covering. Theoret. Comput. Sci. 332 (2005) 83-108
3. Dinur I., and Safra S. On the hardness of approximating minimum vertex cover. Ann. of Math. 162 (2005) 439-485
4. Garey M., and Johnson D. Computers and Intractability (1979), Freeman and Co., New York
5. G. Karakostas, A better approximation ratio for the vertex cover problem, in: ICALP, 2005, pp. 1043-1050
6. Papadimitriou C., and Yannakakis M. Optimization, approximation, and complexity classes. STOC (1988), ACM Press 229-234