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 deduce that there is no approximation algorithm of factor α = 2 poly(m,n) for the volume of a tropical polytope given by n vertices in a space of dimension m, unless P=NP. Neither is there such an approximation algorithm for counting the number of integer points in tropical polytopes described by vertices. If follows that approximating these values for tropical polytopes is more difficult than for classical polytopes. Our proofs use a reduction from the problem of calculating the tropical rank. For tropical polytopes described by inequalities we prove that counting the number of integer points and calculating the volume are #P-hard.
In this paper we provide a new graph theoretic proof of the tropical Jacobi identity, recently obtained in [AGN16]. We also develop an application of this theorem to optimal assignments with supervisions. That is, optimally assigning multiple tasks to one team, or daily tasks to multiple teams, where each team has a supervisor task or a supervised task.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.