Markov-Chain-Based Heuristics for the Feedback Vertex Set Problem for Digraphs

A feedback vertex set (FVS) of an undirected or directed graph G=(V, A) is a set F such that G-F is acyclic. The minimum feedback vertex set problem asks for a FVS of G of minimum cardinality whereas the weighted minimum feedback vertex set problem consists of determining a FVS F of minimum weight w(F) given a real-valued weight function w. Both problems are NP-hard [Karp72]. Nethertheless, they have been found to have applications in many fields. So one is naturally interested in approximation algorithms. While most of the existing approximation algorithms for feedback vertex set problems rely on local properties of G only, this thesis explores strategies that use global information about G in order to determine good solutions. The pioneering work in this direction has been initiated by Speckenmeyer [Speckenmeyer89]. He demonstrated the use of Markov chains for determining low cardinality FVSs. Based on his ideas, new approximation algorithms are developed for both the unweighted and the weighted minimum feedback vertex set problem for digraphs. According to the experimental results presented in this thesis, these new algorithms outperform all other existing approximation algorithms. An additional contribution, not related to Markov chains, is the identification of a new class of digraphs G=(V, A) which permit the determination of an optimum FVS in time O(|V|^4). This class strictly encompasses the completely contractible graphs [Levy/Low88].

[1]  Jeffrey D. Ullman,et al.  Characterizations of Reducible Flow Graphs , 1974, JACM.

[2]  Camil Demetrescu,et al.  Combinatorial algorithms for feedback problems in directed graphs , 2003, Inf. Process. Lett..

[3]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[4]  François Fages,et al.  A constraint programming approach to cutset problems , 2006, Comput. Oper. Res..

[5]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[6]  Giuseppe F. Italiano,et al.  Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Irith Pomeranz,et al.  An optimal algorithm for cycle breaking in directed graphs , 1995, J. Electron. Test..

[8]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[9]  Hanoch Levy,et al.  A Contraction Algorithm for Finding Small Cycle Cutsets , 1988, J. Algorithms.

[10]  Vladimir Gurvich,et al.  Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems , 2004, IPCO.

[11]  Anders Yeo,et al.  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

[12]  Sungju Park,et al.  A Graph Theoretic Approach to Partial Scan Design by K-Cycle Elimination , 1992, Proceedings International Test Conference 1992.

[13]  Michael Jünger,et al.  Polyhedral combinatorics and the acyclic subdigraph problem , 1985 .

[14]  Noga Alon,et al.  Ranking Tournaments , 2006, SIAM J. Discret. Math..

[15]  Ravi Sethi,et al.  Testing for the Church-Rosser Property , 1974, JACM.

[16]  Amy Nicole Langville,et al.  Updating Markov Chains with an Eye on Google's PageRank , 2005, SIAM J. Matrix Anal. Appl..

[17]  Bruce A. Reed,et al.  Packing directed circuits , 1996, Comb..

[18]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[19]  Panos M. Pardalos,et al.  Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP , 2001, TOMS.

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[21]  Mary Lou Soffa,et al.  Feedback vertex sets and cyclically reducible graphs , 1985, JACM.

[22]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[23]  Debashis Bhattacharya,et al.  A three-stage partial scan design method to ease ATPG , 1995, J. Electron. Test..

[24]  Amy Nicole Langville,et al.  A Survey of Eigenvector Methods for Web Information Retrieval , 2005, SIAM Rev..

[25]  Adi Shamir,et al.  A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs , 1979, SIAM J. Comput..

[26]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Feedback Problems , 1996, IPCO.

[27]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[28]  Benno Schwikowski,et al.  On Computing All Minimal Solutions for Feedback Problems , 1997 .

[29]  Xiaotie Deng,et al.  An Approximation Algorithm for Feedback Vertex Sets in Tournaments , 2001, SIAM J. Comput..

[30]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[31]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[32]  Vishwani D. Agrawal,et al.  An exact algorithm for selecting partial scan flip-flops , 1995, J. Electron. Test..

[33]  Jing-Yang Jou,et al.  Computing minimum feedback vertex sets by contraction operations and its applications on CAD , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[34]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[35]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[36]  Mary Lou Soffa,et al.  On Locating Minimum Feedback Vertex Sets , 1988, J. Comput. Syst. Sci..

[37]  Piotr Berman,et al.  Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs , 1995, ISAAC.

[38]  Dan Geiger,et al.  Approximation Algorithms for the Loop Cutset Problem , 1994, UAI.

[39]  Graeme Smith,et al.  The identification of a minimal feedback vertex set of a directed graph , 1975 .

[40]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[41]  S.M. Reddy,et al.  On determining scan flip-flops in partial-scan designs , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[42]  Ewald Speckenmeyer,et al.  On Feedback Problems in Diagraphs , 1989, WG.

[43]  Celso C. Ribeiro,et al.  A Parallel GRASP for the Steiner Problem in Graphs , 1998, IRREGULAR.

[44]  Henning Köhler,et al.  A Contraction Algorithm for finding Minimal Feedback Sets , 2005, ACSC.

[45]  Daniel B. Szyld,et al.  Local convergence of the (exact and inexact) iterative aggregation method for linear systems and Markov operators , 1994 .

[46]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[47]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[48]  Vladimir Gurvich,et al.  Generating 3-vertex connected spanning subgraphs , 2008, Discret. Math..

[49]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem , 1998, J. Comb. Optim..

[50]  E. Lawler.  A Comment on Minimum Feedback Arc Sets , 1964 .

[51]  A. Lumsdaine,et al.  A Sparse Matrix Library in C + + for High PerformanceArchitectures , 1994 .

[52]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[53]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.