Parameterized Complexity of Geometric Problems

This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixed-parameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed-parameter intractability results are surveyed as well. Finally, we give some directions for future research.

[1]  Marc J. van Kreveld,et al.  Geographic information systems , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[2]  Matthew Suderman,et al.  Experiments with the Fixed-Parameter Approach for Two-Layer Planarization , 2003, J. Graph Algorithms Appl..

[3]  Gerhard J. Woeginger,et al.  The Convex-Hull-and-k-Line Travelling Salesman Problem , 1996, Inf. Process. Lett..

[4]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[5]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[6]  T. Bernhardsen.  Geographic Information Systems: An Introduction , 1999 .

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

[8]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[9]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[10]  Jirí Fiala,et al.  Geometric separation and exact solutions for the parameterized independent set problem on disk graphs , 2002, J. Algorithms.

[11]  Micha Sharir,et al.  On the number of crossing-free matchings, (cycles, and partitions) , 2006, SODA '06.

[12]  Sanjeev Arora,et al.  Approximation schemes for NP-hard geometric optimization problems: a survey , 2003, Math. Program..

[13]  Jan Remy,et al.  A quasi-polynomial time approximation scheme for minimum weight triangulation , 2009, JACM.

[14]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

[15]  Giuseppe Liotta,et al.  On the Parameterized Complexity of Layered Graph Drawing , 2001, ESA.

[16]  Alexander Wolff,et al.  Configurations with Few Crossings in Topological Graphs , 2005, ISAAC.

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

[18]  J. Reif.  Complexity of the Generalized Mover's Problem. , 1985 .

[19]  Andreas Spillner.  Optimal convex partitions of point sets with few inner points , 2005, CCCG.

[20]  James U. Korein,et al.  Robotics , 2018, IBM Syst. J..

[21]  Luca Trevisan,et al.  On the Efficiency of Polynomial Time Approximation Schemes , 1997, Inf. Process. Lett..

[22]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[23]  Sergio Cabello,et al.  On the parameterized complexity of d-dimensional point set pattern matching , 2006, Inf. Process. Lett..

[24]  Piotr Indyk,et al.  Nearest Neighbors in High-Dimensional Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[25]  Martin E. Dyer,et al.  A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..

[26]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[27]  Günter Rote,et al.  Minimum-weight triangulation is NP-hard , 2006, JACM.

[28]  Dániel Marx,et al.  Efficient Approximation Schemes for Geometric Problems? , 2005, ESA.

[29]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[30]  Martin Grohe,et al.  Computing crossing numbers in quadratic time , 2000, STOC '01.

[31]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[32]  Gerhard J. Woeginger,et al.  The Traveling Salesman Problem with Few Inner Points , 2004, COCOON.

[33]  Andreas Spillner.  A Faster Algorithm for the Minimum Weight Triangulation Problem with Few Inner Points , 2005, ACiD.

[34]  Vida Dujmovic,et al.  An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization , 2002, Algorithmica.

[35]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

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

[37]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..

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

[39]  Liming Cai,et al.  On Fixed-Parameter Tractability and Approximability of NP Optimization Problems , 1997, J. Comput. Syst. Sci..

[40]  R. Ho.  Algebraic Topology , 2022 .

[41]  Giuseppe Liotta,et al.  A Fixed-Parameter Approach to 2-Layer Planarization , 2001, Algorithmica.

[42]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[43]  Erin W. Chambers,et al.  Splitting (complicated) surfaces is hard , 2006, SCG '06.

[44]  A. Stillings.  Modeling Motion , 2005 .

[45]  Andreas Spillner,et al.  A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators , 2006, WG.

[46]  John E. Howland,et al.  Computer graphics , 1990, IEEE Potentials.

[47]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[48]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[49]  C. Borgelt,et al.  Fixed Parameter Algorithms for Minimum Weight Partitions , 2006 .

[50]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[51]  Sariel Har-Peled,et al.  On coresets for k-means and k-median clustering , 2004, STOC '04.

[52]  B. Ripley,et al.  Pattern Recognition , 1968, Nature.

[53]  Micha Sharir,et al.  Efficient algorithms for geometric optimization , 1998, CSUR.

[54]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

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

[56]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[57]  Tatsuo Ohtsuki,et al.  Applications of computational geometry to VLSI layout pattern design , 1987, Integr..

[58]  Rolf Niedermeier,et al.  Techniques for Practical Fixed-Parameter Algorithms , 2007, Comput. J..

[59]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .

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

[61]  Marco Cesati,et al.  Parameterized complexity analysis in robot motion planning , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[62]  Micha Sharir,et al.  Algorithmic motion planning , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

[64]  Micha Sharir,et al.  Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

[65]  V. Boltyanskii,et al.  Topology of Surfaces , 2001 .

[66]  Dániel Marx,et al.  Parameterized Complexity of Independence and Domination on Geometric Graphs , 2006, IWPEC.

[67]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

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

[69]  Giuseppe Liotta,et al.  On the Parameterized Complexity of Layered Graph Drawing , 2001, Algorithmica.

[70]  Leonidas J. Guibas,et al.  Discrete Geometric Shapes: Matching, Interpolation, and Approximation , 2000, Handbook of Computational Geometry.

[71]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[72]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[73]  Pat Morin,et al.  Covering Things with Things , 2005, Discret. Comput. Geom..

[74]  Jan Kratochvíl,et al.  Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs , 2006, IWPEC.

[75]  Michael Hoffmann,et al.  The Minimum Weight Triangulation Problem with Few Inner Points , 2004, IWPEC.

[76]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[77]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .