Near-optimal solutions for the generalized max-controlled set problem

In this work we deal with sandwich graphs G=(V,E) and present the notion of vertices f-controlled by a subset [email protected]?V. We introduce the generalized max-controlled set problem (GMCSP), where minimum gaps (defined by function f) and positive weights are associated to each vertex of V. In this case, the objective is to find a sandwich graph G in order to maximize the sum of the weights associated to all vertices f-controlled by M. We present a 12-approximation algorithm for the GMCSP and a new procedure for finding feasible solutions based on a linear relaxation. These solutions are then used as starting point in a local search procedure (Tabu Search with Path Relinking) looking for solutions of better quality. Finally, we present some computational results and compare our heuristics with the optimum solution value obtained for some instances of the problem.

[1]  Stéphane Pérennes,et al.  The Power of Small Coalitions in Graphs , 2003, Discret. Appl. Math..

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  Michael E. Saks,et al.  Sphere packing and local majorities in graphs , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[4]  Katherine Vivirito,et al.  Biotechnology and the Human Genome , 1988, Basic Life Sciences.

[5]  Jeffery L. Kennington,et al.  Interfaces in Computer Science and Operations Research , 1997 .

[6]  Fábio Protti,et al.  An improved derandomized approximation algorithm for the max-controlled set problem , 2004, RAIRO Theor. Informatics Appl..

[7]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[8]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[9]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[10]  Haim Kaplan,et al.  Bounded Degree Interval Sandwich Problems , 1999, Algorithmica.

[11]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[12]  David Peleg,et al.  Size Bounds for Dynamic Monopolies , 1998, Discret. Appl. Math..

[13]  Michel Gendreau,et al.  Path relinking for the vehicle routing problem , 2004, J. Heuristics.

[14]  Kazuhisa Makino,et al.  Max- and Min-Neighborhood Monopolies , 2000, SWAT.

[15]  A. Carrano.  Establishing the order of human chromosome-specific DNA fragments. , 1988, Basic life sciences.

[16]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[17]  M. Golumbic,et al.  On the Complexity of DNA Physical Mapping , 1994 .

[18]  Ronald C. Read,et al.  Graph theory and computing , 1972 .

[19]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[20]  Moshe Tennenholtz,et al.  Minimal Social Laws , 1998, AAAI/IAAI.

[21]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[22]  David Peleg,et al.  Local majorities, coalitions and monopolies in graphs: a review , 2002, Theor. Comput. Sci..

[23]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[24]  Martin Charles Golumbic,et al.  Graph Sandwich Problems , 1995, J. Algorithms.

[25]  David Peleg,et al.  Distributed Probabilistic Polling and Applications to Proportionate Agreement , 1999, ICALP.

[26]  C. Ribeiro,et al.  Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs , 2002 .