Exact algorithms for NP hard problems on networks: design, analysis and implementation

[1]  N. Alon,et al.  A separator theorem for nonplanar graphs , 1990 .

[2]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[3]  Zhi-Zhong Chen,et al.  Approximation Algorithms for Independent Sets in Map Graphs , 2000, J. Algorithms.

[4]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[6]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[7]  Heribert Vollmer,et al.  A polynomial-time approximation scheme for base station positioning in UMTS networks , 2001, DIALM '01.

[8]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[9]  Martin Grohe.  Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2003, Comb..

[10]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[12]  Rolf Niedermeier,et al.  Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time , 2002, CPM.

[13]  Bruce A. Reed,et al.  Finding approximate separators and computing tree width quickly , 1992, STOC '92.

[14]  Takao Asano,et al.  An Approach to the Subgraph Homeomorphism Problem , 1985, Theor. Comput. Sci..

[15]  Ronald C. Read,et al.  Prospects for Graph Theory Algorithms , 1993 .

[16]  Reinhard Diestel,et al.  Simplicial decompositions of graphs: a survey of applications , 1989, Discret. Math..

[17]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[18]  Francesco M. Donini,et al.  Preprocessing of Intractable Problems , 2002, Inf. Comput..

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

[20]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[21]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[22]  V. Rich.  Personal communication , 1989, Nature.

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

[24]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

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

[26]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[27]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[28]  Dimitrios M. Thilikos,et al.  Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.

[29]  Illya V. Hicks.  Branch decompositions and their applications , 2000 .

[30]  Madhu Sudan,et al.  A Geometric Approach to Betweenness , 1995, ESA.

[31]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[32]  Shimon Even,et al.  Graph Algorithms , 1979 .

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

[34]  Robin Thomas,et al.  Efficiently four-coloring planar graphs , 1996, STOC '96.

[35]  Rolf Niedermeier,et al.  Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case , 2002, SWAT.

[36]  Rolf Niedermeier,et al.  An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover , 1999, J. Algorithms.

[37]  Dimitrios Thilikos Touloupas,et al.  New upper bounds on the decomposability of planar graphs and fixed parameter algorithms , 2002 .

[38]  Hristo Djidjev,et al.  Reduced constants for simple cycle graph separation , 1997, Acta Informatica.

[39]  John R. Gilbert,et al.  Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree , 1995, J. Algorithms.

[40]  D. Corneil,et al.  A dynamic programming approach to the dominating set problem on k trees , 1987 .

[41]  Rolf Niedermeier,et al.  On Multidimensional Curves with Hilbert Property , 2000, Theory of Computing Systems.

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

[43]  Ljubomir Perkovic,et al.  Improved Parameterized Algorithms for Planar Dominating Set , 2002, MFCS.

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

[45]  Paolo Penna,et al.  Server Placements, Roman Domination and other Dominating Set Variants , 2002, IFIP TCS.

[46]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

[47]  Bengt Aspvall,et al.  Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms , 2000, Algorithmica.

[48]  Rolf Niedermeier,et al.  On Multi-dimensional Hilbert Indexings , 1998, COCOON.

[49]  Gary L. Miller,et al.  Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.

[50]  Jan Arne Telle,et al.  Complexity of Domination-Type Problems in Graphs , 1994, Nord. J. Comput..

[51]  Bengt Aspvall,et al.  Memory Requirements for Table Computations in Partial k-tree Algorithms , 1998, SWAT.

[52]  Tomomi Matsui,et al.  Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs , 1998, JCDCG.

[53]  Robin Thomas,et al.  Call routing and the ratcatcher , 1994, Comb..

[54]  Ton Kloks,et al.  New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs , 2002, WG.

[55]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[56]  G. Ringel,et al.  Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[57]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[58]  V. Paschos.  A survey of approximately optimal solutions to some covering and packing problems , 1997, CSUR.

[59]  Rolf Niedermeier,et al.  An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.

[60]  Samir Khuller,et al.  Algorithms column: the vertex cover problem , 2002, SIGA.

[61]  E. Rowland.  Theory of Games and Economic Behavior , 1946, Nature.

[62]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[63]  Bruno Courcelle,et al.  An algebraic theory of graph reduction , 1993, JACM.

[64]  Fedor V. Fomin,et al.  Tree decompositions with small cost , 2002, Discret. Appl. Math..

[65]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[66]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

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

[69]  Clyde L. Monma,et al.  On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..

[70]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[71]  D. Knuth,et al.  Mathematics for the Analysis of Algorithms , 1999 .

[72]  Dave A. Berque,et al.  Implementing progress indicators for recursive algorithms , 1993, SAC '93.

[73]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[74]  Constant Time Computation of Minimum Dominating Sets , 1994 .

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

[76]  Liming Cai,et al.  On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..

[77]  Norman,et al.  Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .

[78]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[79]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[80]  Zhi-Zhong Chen,et al.  Map graphs , 1999, JACM.

[81]  Dieter Kratsch,et al.  On treewidth approximations , 2004, Discret. Appl. Math..

[82]  Bojan Mohar,et al.  A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface , 1999, SIAM J. Discret. Math..

[83]  V. Kann,et al.  How to find the best approximation results – a follow-up to Garey and Johnson ∗ , 1998 .

[84]  Shlomo Moran,et al.  Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theor. Comput. Sci..

[85]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[86]  André E. Kézdy,et al.  Sequential and parallel algorithms to find a K5 minor , 1992, SODA '92.

[87]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[88]  Erik D. Demaine,et al.  -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor , 2002, APPROX.

[89]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[90]  Ewa Malesinska.  Graph-Theoretical Models for Frequency Assignment Problems , 1997 .

[91]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[92]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

[93]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2001, J. Algorithms.

[94]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[96]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[97]  Meena Mahajan,et al.  Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..

[98]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[99]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

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

[101]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[102]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[103]  A. Bonato,et al.  Graphs and Hypergraphs , 2021, Clustering.

[104]  David Peleg,et al.  Exact Algorithms and Approximation Schemes for Base Station Placement Problems , 2002, SWAT.

[105]  Eugene L. Lawler,et al.  Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.

[106]  Rolf Niedermeier,et al.  Improved Tree Decomposition Based Algorithms for Domination-like Problems , 2002, LATIN.

[107]  Paul D. Seymour,et al.  Excluding a graph with one crossing , 1991, Graph Structure Theory.

[108]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[109]  Norishige Chiba,et al.  A Linear 5-Coloring Algorithm of Planar Graphs , 1981, J. Algorithms.

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

[111]  Erik D. Demaine,et al.  Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs , 2002, ISAAC.

[112]  Rolf Niedermeier,et al.  Graph Separators: A Parameterized View , 2001, COCOON.

[113]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[114]  H. Djidjev.  On the Problem of Partitioning Planar Graphs , 1982 .

[115]  Michael R. Fellows,et al.  Parameterized Complexity: The Main Ideas and Some Research Frontiers , 2009, ISAAC.

[116]  B. A. Farbey,et al.  Structural Models: An Introduction to the Theory of Directed Graphs , 1966 .

[117]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[118]  David Eppstein,et al.  A deterministic linear time algorithm for geometric separators and its applications , 1993, SCG '93.

[119]  Arkady Kanevsky,et al.  Finding all minimum-size separating vertex sets in a graph , 1993, Networks.

[120]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[121]  Illya V. Hicks,et al.  Planar Branch Decompositions , 2000 .

[122]  Hristo Djidjev,et al.  Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus , 1996, SIAM J. Discret. Math..

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

[124]  Robin Thomas,et al.  Planar Separators , 1994, SIAM J. Discret. Math..

[125]  Jon M. Kleinberg,et al.  A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search , 2002, Theor. Comput. Sci..

[126]  Stefan Arnborg,et al.  Forbidden minors characterization of partial 3-trees , 1990, Discret. Math..

[127]  Arie M. C. A. Koster,et al.  Treewidth: Computational Experiments , 2001, Electron. Notes Discret. Math..

[128]  Sugih Jamin,et al.  Inet: Internet Topology Generator , 2000 .

[129]  Klaus Jansen,et al.  Polynomial-time approximation schemes for geometric graphs , 2001, SODA '01.

[130]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[131]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

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

[133]  Amit Sahai,et al.  Pushing disks together—the continuous-motion case , 1996, STOC '96.

[134]  Shang-Hua Teng,et al.  Disk packings and planar separators , 1996, SCG '96.

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

[136]  Jochen Alber,et al.  On implemented semigroups , 2001 .

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

[138]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[139]  Rolf Niedermeier,et al.  Upper Bounds for Vertex Cover Further Improved , 1999, STACS.

[140]  Michael R. Fellows,et al.  An Improved Fixed-Parameter Algorithm for Vertex Cover , 1998, Inf. Process. Lett..

[141]  Shankar M. Venkatesan.  Improved Constants for Some Separator Theorems , 1987, J. Algorithms.

[142]  M. Fellows,et al.  An improved fixed parameter tractable algorithm for vertex cover , 1999 .

[143]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[144]  Jie Wu,et al.  Domination and its applications in ad hoc wireless networks with unidirectional links , 2000, Proceedings 2000 International Conference on Parallel Processing.

[145]  W. Kent Fuchs,et al.  Efficient Spare Allocation in Reconfigurable Arrays , 1986, 23rd ACM/IEEE Design Automation Conference.

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

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

[148]  Jan Arne Telle,et al.  Algorithms for Vertex Partitioning Problems on Partial k-Trees , 1997, SIAM J. Discret. Math..

[149]  Henning Fernau,et al.  Graph Separator Algorithms: A Refined Analysis , 2002, WG.

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

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

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

[153]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[154]  Michael R. Fellows,et al.  Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..

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

[156]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

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

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

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