Parametric Shortest Paths in Planar Graphs

  title={Parametric Shortest Paths in Planar Graphs},
  author={Kshitij Gajjar and Jaikumar Radhakrishnan},
  journal={2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)},
We construct a family of planar graphs {G_n}_n≥4, where G_n has n vertices including a source vertex s, a sink vertex t, and edge weights that change linearly with a parameter λ such that, as λ varies in (-∞,+∞), the piece-wise linear cost of the shortest path from s to t has n^Ω(logn) pieces. This shows that lower bounds obtained by Carstensen (1983) and Mulmuley & Shah (2001) for general graphs also hold for planar graphs, refuting a conjecture of Nikolova (2009). Gusfield (1980) and Dean… Expand
Minimum Cuts in Surface Graphs
It is proved that finding a minimum-weight subgraph homologous to a single input cycle is NP-hard, showing it is likely impossible to improve upon the exponential dependencies on $g$ for this latter problem. Expand


Maximum flows and parametric shortest paths in planar graphs
It is demonstrated that for a similarly structured parametric shortest path problem on the torus, the shortest path tree can change Ω(n2) times in the worst case, suggesting that a different method may be required to efficiently compute maximum flows in higher-genus graphs. Expand
Parametric shortest path algorithms with an application to cyclic staffing
A parametric algorithm for computing the shortest path from s to each vertex υ ϵ V parametrically in the parameter λ may be used in conjunction with a transformation given by Bartholdi, Orlin, and Ratliff to give an O(n2 log n) algorithm for the cyclic staffing problem. Expand
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
A new relatively simple but versatile framework is developed that handles the combinatorial structure of matchings directly and needs to only know weights of appropriately defined matchings from algebraic subroutines. Expand
Polynomial bounds for the grid-minor theorem
The first polynomial relationship between treewidth and grid-minor size is obtained by showing that f(k) = Ω(kδ) for some fixed constant δ > 0, and an algorithm is described that finds a model of such a grid-Minor in G. Expand
Two-phase Algorithms for the Parametric Shortest Path Problem
Several parametric algorithms for the shortest path problem are constructed and for the case of linear function weights the authors present an algorithm for the single source shortest path problems. Expand
Planar Graph Perfect Matching Is in NC
  • Nima Anari, V. Vazirani
  • Mathematics, Computer Science
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
This paper gives an NC algorithm for finding a perfect matching in a planar graph at which many new conditions, involving constraints of the polytope, are simultaneously satisfied. Expand
An O (n log n) algorithm for maximum st-flow in a directed planar graph
The first correct O(n) algorithm for finding a maximum flow in a directed planar graph is given, which consists of repeatedly saturating the leftmost residual residual of the shortest-path path. Expand
Stochastic Shortest Paths Via Quasi-convex Maximization
This work gives a surprising exact nΘ (log n) algorithm for the case of normally distributed edge lengths, which is based on quasi-convex maximization and proves average and smoothed polynomial bounds for this algorithm, which also translate to average and smoother bounds for the parametric shortest path problem. Expand
Moser's Shadow Problem
This paper presents correct order of magnitude asymptotic bounds on these functions and shows the bounded case has answer sb(n) = Θ ( log(n)/( log(log(n)) ) ) , a result following from 1989 work of Chazelle, Edelsbrunner and Guibas. Expand
A lower bound for the shortest path problem
  • K. Mulmuley, P. Shah
  • Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
This paper shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in the unbounded fan-in PRAM model without bit operations. Expand