Algorithm design techniques for parameterized graph modification problems

Diese Arbeit beschaeftigt sich mit dem Entwurf parametrisierter Algorithmen fuer Graphmodifikationsprobleme wie Feedback Vertex Set, Multicut in Trees, Cluster Editing und Closest 3-Leaf Powers. Anbei wird die Anwendbarkeit von vier Technicken zur Entwicklung parametrisierter Algorithmen, naemlich, Datenreduktion, Suchbaum, Iterative Kompression und Dynamische Programmierung, fuer solche Graphmodifikationsprobleme untersucht.

[1]  Rolf Niedermeier,et al.  Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.

[2]  Stefan Szeider,et al.  On Fixed-Parameter Tractable Parameterizations of SAT , 2003, SAT.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2006, J. Discrete Algorithms.

[5]  Alexander S. Kulikov.  Automated Generation of Simplification Rules for SAT and MAXSAT , 2005, SAT.

[6]  Rolf Niedermeier,et al.  Exact algorithms and applications for Tree-like Weighted Set Cover , 2006, J. Discrete Algorithms.

[7]  Rajeev Motwani,et al.  Computing Roots of Graphs Is Hard , 1994, Discret. Appl. Math..

[8]  Rolf Niedermeier,et al.  Experiments on data reduction for optimal domination in networks , 2006, Ann. Oper. Res..

[9]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[10]  Rolf Niedermeier,et al.  Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems , 2004, Algorithmica.

[11]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[12]  Rolf Niedermeier,et al.  A Structural View on Parameterizing Problems: Distance from Triviality , 2004, IWPEC.

[13]  A. Nagurney.  Innovations in Financial and Economic Networks , 2003 .

[14]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[15]  Heikki Mannila,et al.  Ordered and Unordered Tree Inclusion , 1995, SIAM J. Comput..

[16]  Michael A. Henning,et al.  Domination in Graphs Applied to Electric Power Networks , 2002, SIAM J. Discret. Math..

[17]  Reuven Bar-Yehuda,et al.  Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..

[18]  Bruce A. Reed,et al.  Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width , 2003, J. Algorithms.

[19]  Rolf Niedermeier,et al.  Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs , 2005, Discret. Appl. Math..

[20]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[21]  Zhi-Zhong Chen,et al.  Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs , 2004, WG.

[22]  Rolf Niedermeier,et al.  Fixed‐parameter tractability and data reduction for multicut in trees , 2005, Networks.

[23]  Anita Schöbel,et al.  Set covering with almost consecutive ones property , 2004, Discret. Optim..

[24]  Rolf Niedermeier,et al.  The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions , 2006, Int. J. Found. Comput. Sci..

[25]  Rolf Niedermeier,et al.  Parameterized Complexity of Generalized Vertex Cover Problems , 2005, WADS.

[26]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[27]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[28]  Tao Jiang,et al.  Phylogenetic k-Root and Steiner k-Root , 2000, ISAAC.

[29]  Joseph B. Kruskal,et al.  Time Warps, String Edits, and Macromolecules , 1999 .

[30]  Robert E. Bixby,et al.  An Almost Linear-Time Algorithm for Graph Realization , 1988, Math. Oper. Res..

[31]  Rolf Niedermeier,et al.  Error Compensation in Leaf Power Problems , 2005, Algorithmica.

[32]  Stefan Szeider,et al.  Citation for Published Item: Use Policy Minimal Unsatisfiable Formulas with Bounded Clause-variable Difference Are Fixed-parameter Tractable , 2022 .

[33]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[34]  Peter Damaschke.  Parameterized enumeration, transversals, and imperfect phylogeny reconstruction , 2006, Theor. Comput. Sci..

[35]  Alejandro Pazos Sierra,et al.  Encyclopedia of Artificial Intelligence , 2008 .

[36]  Faisal N. Abu-Khzam,et al.  Scalable Parallel Algorithms for FPT Problems , 2006, Algorithmica.

[37]  Samir Khuller,et al.  Capacitated vertex covering , 2003, J. Algorithms.

[38]  Ulrike Stege,et al.  Solving large FPT problems on coarse-grained parallel machines , 2003, J. Comput. Syst. Sci..

[39]  Saket Saurabh,et al.  Faster algorithms for feedback vertex set , 2005, Electron. Notes Discret. Math..

[40]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[41]  Ton Kloks.  Treewidth, Computations and Approximations , 1994, Lecture Notes in Computer Science.

[42]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[43]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[44]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[45]  Rodney G. Downey,et al.  Parameterized complexity for the skeptic , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[46]  Bruce A. Reed,et al.  Planar graph bipartization in linear time , 2005, Discret. Appl. Math..

[47]  Rolf Niedermeier,et al.  Data Reduction, Exact, and Heuristic Algorithms for Clique Cover , 2006, ALENEX.

[48]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[49]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[50]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

[51]  Rolf Niedermeier,et al.  Complexity and Exact Algorithms for Multicut , 2006, SOFSEM.

[52]  Mihalis Yannakakis,et al.  Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..

[53]  Rolf Niedermeier,et al.  On Exact and Approximation Algorithms for Distinguishing Substring Selection , 2003, FCT.

[54]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[55]  Steven Skiena,et al.  Algorithms for Square Roots of Graphs , 1991, SIAM J. Discret. Math..

[56]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..

[57]  Rajiv Gandhi,et al.  An improved approximation algorithm for vertex cover with hard capacities , 2003, J. Comput. Syst. Sci..

[58]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[59]  Jochen Alber,et al.  Exact algorithms for NP hard problems on networks: design, analysis and implementation , 2002 .

[60]  Fabrizio Grandoni,et al.  Refined memorization for vertex cover , 2005, Inf. Process. Lett..

[61]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

[62]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[63]  Roded Sharan,et al.  Algorithmic approaches to clustering gene expression data , 2001 .

[64]  Falk Hüffner.  Graph Modification Problems and Automated Search Tree Generation , 2003 .

[65]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[66]  Frédéric Roupin,et al.  Minimal multicut and maximal integer multiflow: A survey , 2005, Eur. J. Oper. Res..

[67]  Rolf Niedermeier,et al.  Computing the similarity of two sequences with nested arc annotations , 2004, Theor. Comput. Sci..

[68]  Benno Schwikowski,et al.  On enumerating all minimal solutions of feedback problems , 2002, Discret. Appl. Math..

[69]  James M. Bower,et al.  Computational modeling of genetic and biochemical networks , 2001 .

[70]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[71]  Fred S. Roberts,et al.  Applications of combinatorics and graph theory to the biological and social sciences , 1989 .

[72]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[73]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[74]  Andrew B. Kahng,et al.  New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout , 2001, ASP-DAC '01.

[75]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, COCOON.

[76]  Frank Harary,et al.  Graph Theory , 2016 .

[77]  W. T. Tutte.  An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[78]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[79]  S. Salzberg,et al.  Hierarchical scaffolding with Bambus. , 2003, Genome research.

[80]  Falk Hüffner,et al.  Algorithm Engineering for Optimal Graph Bipartization , 2005, J. Graph Algorithms Appl..

[81]  Hans L. Bodlaender,et al.  On Disjoint Cycles , 1991, Int. J. Found. Comput. Sci..

[82]  Alexander S. Kulikov,et al.  Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms , 2004, IWPEC.

[83]  Chak-Kuen Wong,et al.  Covering edges by cliques with regard to keyword conflicts and intersection graphs , 1978, CACM.

[84]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[85]  Michael R. Fellows,et al.  The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus , 2002, SWAT.

[86]  Roderic D. M. Page,et al.  Vertebrate Phylogenomics: Reconciled Trees and Gene Duplications , 2001, Pacific Symposium on Biocomputing.

[87]  Nader H. Bshouty,et al.  Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem , 1998, STACS.

[88]  Joseph Naor,et al.  Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications , 2000, SIAM J. Discret. Math..

[89]  Mihalis Yannakakis,et al.  Edge-Deletion Problems , 1981, SIAM J. Comput..

[90]  Asuman E. Ozdaglar,et al.  Routing and wavelength assignment in optical networks , 2003, TNET.

[91]  Rolf Niedermeier,et al.  Extending the Tractability Border for Closest Leaf Powers , 2005, WG.

[92]  Rolf Niedermeier,et al.  Avoiding Forbidden Submatrices by Row Deletions , 2004, SOFSEM.

[93]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[94]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[95]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.

[96]  Rolf Niedermeier,et al.  Bounded Degree Closest k-Tree Power Is NP-Complete , 2005, COCOON.

[97]  Zhi-Zhong Chen,et al.  Computing Phylogenetic Roots with Bounded Degrees and Errors , 2001, WADS.

[98]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[99]  Michael R. Fellows,et al.  New Directions and New Challenges in Algorithm Design and Complexity, Parameterized , 2003, WADS.

[100]  Haim Kaplan,et al.  Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs , 1999, SIAM J. Comput..

[101]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..

[102]  Michael R. Fellows,et al.  Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.

[103]  Amit Kumar,et al.  Approximation Algorithms for the Unsplittable Flow Problem , 2002, Algorithmica.

[104]  Mihalis Yannakakis,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[105]  Roded Sharan,et al.  Complexity classification of some edge modification problems , 1999, Discret. Appl. Math..

[106]  Luciano Rossoni,et al.  Models and methods in social network analysis , 2006 .

[107]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[108]  Liming Cai,et al.  Advice Classes of Parameterized Tractability , 1997, Ann. Pure Appl. Log..

[109]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[110]  Henning Fernau,et al.  On Parameterized Enumeration , 2002, COCOON.

[111]  Roded Sharan,et al.  Cluster graph modification problems , 2002, Discret. Appl. Math..

[112]  Stefan Richter,et al.  Parameterized power domination complexity , 2006, Inf. Process. Lett..

[113]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[114]  Peter Damaschke.  On the Fixed-Parameter Enumerability of Cluster Editing , 2005, WG.

[115]  Saket Saurabh,et al.  Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set , 2002, ISAAC.

[116]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[117]  R. Neuman.  Analysis of human genetic linkage, revised edition , 1993 .

[118]  Chandra Chekuri,et al.  Multicommodity Demand Flow in a Tree , 2003, ICALP.

[119]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[120]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[121]  Mirko Krivánek,et al.  NP-hard problems in hierarchical-tree clustering , 1986, Acta Informatica.

[122]  Jan Arne Telle,et al.  Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems , 1993, WADS.

[123]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.

[124]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[125]  Rolf Niedermeier,et al.  A fixed-parameter tractability result for multicommodity demand flow in trees , 2006, Inf. Process. Lett..

[126]  Amos Fiat,et al.  Correlation Clustering - Minimizing Disagreements on Arbitrary Weighted Graphs , 2003, ESA.

[127]  H. Bodlaender.  Classes of graphs with bounded tree-width , 1986 .

[128]  Rolf Niedermeier,et al.  Tree decompositions of graphs: Saving memory in dynamic programming , 2004, Discret. Optim..

[129]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[130]  R. Ravi,et al.  On the Approximability of the Minimum Test Collection Problem , 2001, ESA.

[131]  Rolf Niedermeier,et al.  Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.

[132]  Joseph Naor,et al.  Covering problems with hard capacities , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[133]  Nicole Immorlica,et al.  Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques , 2003, Lecture Notes in Computer Science.

[134]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[135]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[136]  Thomas Erlebach,et al.  Call control with k rejections , 2002, J. Comput. Syst. Sci..

[137]  Oliver Kullmann,et al.  New Methods for 3-SAT Decision and Worst-case Analysis , 1999, Theor. Comput. Sci..

[138]  Charles J. Colbourn,et al.  The complexity of some edge deletion problems , 1988 .

[139]  Arthur F. Veinott,et al.  Optimal Capacity Scheduling---II , 1962 .

[140]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[141]  Ojas Parekh,et al.  Improved Approximations for Tour and Tree Covers , 2000, Algorithmica.

[142]  R. Battiti,et al.  Covering Trains by Stations or the Power of Data Reduction , 1998 .

[143]  Rolf Niedermeier,et al.  Error Compensation in Leaf Root Problems , 2004, ISAAC.

[144]  Markus Bläser,et al.  Computing small partial coverings , 2003, Inf. Process. Lett..

[145]  Reuven Bar-Yehuda,et al.  Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference , 1998, SIAM J. Comput..

[146]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[147]  Rolf Niedermeier,et al.  Minimum Membership Set Covering and the Consecutive Ones Property , 2006, SWAT.

[148]  Rolf Niedermeier,et al.  Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms , 2004, MFCS.

[149]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[150]  Takao Asano,et al.  Edge-deletion and edge-contraction problems , 1982, STOC '82.

[151]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[152]  B. Monien.  The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete , 1986 .

[153]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[154]  Derek G. Corneil,et al.  Tree Powers , 1998, J. Algorithms.

[155]  Karsten Weihe.  On the Differences between "Practical" and "Applied" , 2000, Algorithm Engineering.

[156]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[157]  Dorothea Wagner,et al.  Solving Geometric Covering Problems by Data Reduction , 2004, ESA.

[158]  Michael J. Pelsmajer,et al.  Parameterized Algorithms for Feedback Vertex Set , 2004, IWPEC.

[159]  Sergey I. Nikolenko,et al.  Worst-case upper bounds for SAT: automated proof , 2003 .

[160]  Lap Chi Lau,et al.  Bipartite roots of graphs , 2004, TALG.

[161]  Gabriel Valiente,et al.  Algorithms on Trees and Graphs , 2002, Springer Berlin Heidelberg.

[162]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[163]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

[164]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[165]  Goos Kant,et al.  On an integer multicommodity flow problem from the airplane industry , 1997 .

[166]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..