Experimental analysis of heuristic algorithms for the dominating set problem

Algorithmica (New York)

Volumn 33, Issue 1, 2002, Pages 3-18

  Sanchis, L A ^a  

^a Assistant Professor in the University Libraries   (United States)

Author keywords

Approximation algorithms; Dominating set; Test cases

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY;

DOMINATING SETS;

ALGORITHMS;

EID: 0141888117     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0101-z     Document Type: Article

References (7)

1. Sanjeev Arora and Garsten Lund, Hardness of Approximations, in D. S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 399-446, PWS, Boston, MA, 1997.
2. Thomas S. Feo, Mauricio G. C. Resende, and Stuart H. Smith, A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set, Operations Research, vol.42, no. 5, September-October 1994, pages 860-978.
3. Sotiris E. Nikoletseas and Paul G. Spirakis, Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time, in Graph-Theoretic Concepts in Computer Science (Utrecht, 1993), Lecture Notes in Computer Science, vol. 790, Springer-Verlag, Berlin, 1994.
4. Abhay K. Parekh, Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs, Information Processing Letters, vol. 39, 1991, pages 237-240.
5. Laura A. Sanchis, Test Case Construction for the Vertex Cover Problem, in N. Dean and G. E. Shannon, editors, Computational Support for Discrete Mathematics, pages 315-326, American Mathematical Society, Providence, RI, 1994.
6. Laura A. Sanchis, Generating Hard and Diverse Test Sets for NP-Hard Graph Problems, Discrete Applied Mathematics, vol. 58, 1995, pages 35-66.
7. Laura A. Sanchis and Arun Jagota, Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem, INFORMS Journal on Computing, vol. 8, no. 2, Spring 1996, pages 87-102.