Related papers: Tropical determinant on transportation polytope

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We fix the supports A=(A_1,...,A_k) of a list of tropical polynomials and define the tropical resultant TR(A) to be the set of choices of coefficients such that the tropical polynomials have a common solution. We prove that TR(A) is the…

This work tackles the problem of characterizing and understanding the decision boundaries of neural networks with piecewise linear non-linearity activations. We use tropical geometry, a new development in the area of algebraic geometry, to…

In this work, we solve a discrete optimal transport problem in a nonuniform environment. To solve the optimal transport problem, we build the cost matrix and then use classical solvers for discrete optimal transport. The challenge is to…

We develop a tropical analog of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including the computation of reduced costs, in O(n(m+n)) time, where m…

This thesis delves into the geometry of abstract tropical curves, exploring their complete linear system and associated tropical submodules. We establish a lower bound on the dimension of tropical submodules in terms of the Baker-Norine…

Transportation matrices are $m\times n$ non-negative matrices whose row sums and row columns are equal to, or dominated above with given integral vectors $R$ and $C$. Those matrices belong to a convex polytope whose extreme points have been…

For the online transportation problem with $m$ server sites, it has long been known that the competitive ratio of any deterministic algorithm is at least $2m-1$. Kalyanasundaram and Pruhs conjectured in 1998 that a deterministic…

We undertake a combinatorial study of the piecewise linear map g : R^{2m+2n} --> R^{mn} which assigns to the four vectors a, A in R^m and b, B in R^n the m by n matrix given by g_{ij} = min (a_i + b_j, A_i+B_j). This map arises naturally in…

We prove the first, even super-polynomial, lower bounds on the size of tropical (min,+) and (max,+) circuits approximating given optimization problems. Many classical dynamic programming (DP) algorithms for optimization problems are pure in…

We investigate the complexity of counting the number of integer points in tropical polytopes, and the complexity of calculating their volume. We study the tropical analogue of the outer parallel body and establish bounds for its volume. We…

We study a tropical linear regression problem consisting in finding the best approximation of a set of points by a tropical hyperplane. We establish a strong duality theorem, showing that the value of this problem coincides with the maximal…

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

We study tropical commuting matrices from two viewpoints: linear algebra and algebraic geometry. In classical linear algebra, there exist various criteria to test whether two square matrices commute. We ask for similar criteria in the realm…

We present simple compact proofs of the strong and weak duality theorems of tropical linear programming. It follows that there is no duality gap for a pair of tropical primal-dual problems. This result together with known properties of…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

The paper focuses on a multidimensional optimization problem, which is formulated in terms of tropical mathematics and consists in minimizing a nonlinear objective function subject to linear inequality constraints. To solve the problem, we…

We examine a multidimensional optimisation problem in the tropical mathematics setting. The problem involves the minimisation of a nonlinear function defined on a finite-dimensional semimodule over an idempotent semifield subject to linear…

In this paper, we consider the $k$-Covering Canadian Traveller Problem ($k$-CCTP), which can be seen as a variant of the Travelling Salesperson Problem. The goal of $k$-CCTP is finding the shortest tour for a traveller to visit a set of…

The tropical arithmetic operations on $\mathbb{R}$ are defined by $a\oplus b=\min\{a,b\}$ and $a\otimes b=a+b$. Let $A$ be a tropical matrix and $k$ a positive integer, the problem of Tropical Matrix Factorization (TMF) asks whether there…