A Linear Algorithm for Finding the Sink of Unique Sink Orientations on Grids

An orientation of a grid is called unique sink orientation (USO) if each of its nonempty subgrids has a unique sink. Particularly, the original grid itself has a unique global sink. In this work we investigate the problem of how to find the global sink using minimum number of queries to an oracle. There are two different oracle models: the vertex query model where the orientation of all edges incident to the queried vertex are provided, and the edge query model where the orientation of the queried edge is provided. In the 2-dimensional case, we design an optimal linear deterministic algorithm for the vertex query model and an almost linear deterministic algorithm for the edge query model, previously the best known algorithms run in O(N logN) time for the vertex query model and O(N^1.404) time for the edge query model.

[1]  Jirí Matousek,et al.  Random edge can be exponential on abstract cubes , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[2]  Uri Zwick,et al.  Subexponential lower bounds for randomized pivoting rules for the simplex algorithm , 2011, STOC '11.

[3]  Stefan Felsner,et al.  Grid Orientations, (d,d + 2)-Polytopes, and Arrangements of Pseudolines , 2005, Discret. Comput. Geom..

[4]  Tibor Szabó,et al.  Unique sink orientations of cubes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[5]  Bernd Gärtner,et al.  Unique Sink Orientations of Grids , 2005, Algorithmica.

[6]  Malte Milatz.  Directed Random Walks on Polytopes with Few Facets , 2017, Electron. Notes Discret. Math..

[7]  G. Dantzig,et al.  A generalization of the linear complementarity problem , 1970 .

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

[9]  Uri Zwick,et al.  Random-Facet and Random-Bland require subexponential time even for shortest paths , 2014, ArXiv.

[10]  Bernd Gärtner,et al.  Linear programming and unique sink orientations , 2006, SODA '06.

[11]  Luis Barba,et al.  Deterministic Algorithms for Unique Sink Orientations of Grids , 2016, COCOON.

[12]  Jiří Matoušek,et al.  Lower Bounds for a Subexponential Optimization Algorithm , 1994, Random Struct. Algorithms.

[13]  V. Klee,et al.  A proof of the strict monotone 4-step conjecture , 1998 .

[14]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[15]  Robert G. Bland,et al.  New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..

[16]  József Solymosi,et al.  One line and n points , 2003, STOC.

[17]  Michael J. Todd,et al.  Polynomial Algorithms for Linear Programming , 1988 .