DeepAI AI Chat
Log In Sign Up

A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes

by   Koyo Hayashi, et al.
The University of Tokyo

This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Owen and Provan's algorithm (2011) as a subroutine. Our algorithm is applicable to any CAT(0) space in which geodesics between two close points can be computed, not limited to CAT(0) cubical complexes.


page 1

page 2

page 3

page 4


A Polynomial Time Algorithm for a NPC Problem

It is introduced a so called 'Multi-stage graph Simple Path' problem (MS...

A Polynomial-time Algorithm to Compute Generalized Hermite Normal Form of Matrices over Z[x]

In this paper, a polynomial-time algorithm is given to compute the gener...

Computing homotopy classes for diagrams

We present an algorithm that, given finite simplicial sets X, A, Y with ...

A Deterministic Algorithm for the Capacity of Finite-State Channels

We propose a modified version of the classical gradient descent method t...

Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach

The experimental design problem concerns the selection of k points from ...

Short Schedules for Fast Flow Rerouting

This paper studies the fundamental problem of how to reroute k unsplitta...

iPCA and stability of star quivers

Integrated principal components analysis, or iPCA, is an unsupervised le...