# Minimum 0-Extension Problems on Directed Metrics

For a metric μ on a finite set T, the minimum 0-extension problem 0-Ext[μ] is defined as follows: Given V⊇ T and c:V 2→𝐐_+, minimize ∑ c(xy)μ(γ(x),γ(y)) subject to γ:V→ T, γ(t)=t (∀ t∈ T), where the sum is taken over all unordered pairs in V. This problem generalizes several classical combinatorial optimization problems such as the minimum cut problem or the multiterminal cut problem. The complexity dichotomy of 0-Ext[μ] was established by Karzanov and Hirai, which is viewed as a manifestation of the dichotomy theorem for finite-valued CSPs due to Thapper and Živný. In this paper, we consider a directed version 0-Ext[μ] of the minimum 0-extension problem, where μ and c are not assumed to be symmetric. We extend the NP-hardness condition of 0-Ext[μ] to 0-Ext[μ]: If μ cannot be represented as the shortest path metric of an orientable modular graph with an orbit-invariant “directed” edge-length, then 0-Ext[μ] is NP-hard. We also show a partial converse: If μ is a directed metric of a modular lattice with an orbit-invariant directed edge-length, then 0-Ext[μ] is tractable. We further provide a new NP-hardness condition characteristic of 0-Ext[μ], and establish a dichotomy for the case where μ is a directed metric of a star.

## Authors

• 9 publications
• 1 publication
• ### Generalized minimum 0-extension problem and discrete convexity

Given a fixed finite metric space (V,μ), the minimum 0-extension problem...
09/21/2021 ∙ by Martin Dvorak, et al. ∙ 0

• ### Generalized max-flows and min-cuts in simplicial complexes

We consider high dimensional variants of the maximum flow and minimum cu...
06/27/2021 ∙ by William Maxwell, et al. ∙ 0

• ### Solving Minimum k-supplier in Adleman-Lipton model

In this paper, we consider an algorithm for solving the minimum k suppli...
01/17/2018 ∙ by Saeid Safaei, et al. ∙ 0

• ### Parametrised Algorithms for Directed Modular Width

Many well-known NP-hard algorithmic problems on directed graphs resist e...
05/30/2019 ∙ by Raphael Steiner, et al. ∙ 0

• ### Algorithms for the Minmax Regret Path Problem with Interval Data

The Shortest Path in networks is an important problem in Combinatorial O...
03/17/2020 ∙ by Francisco Pérez-Galarce, et al. ∙ 0

• ### Hardness of Minimum Barrier Shrinkage and Minimum Activation Path

In the Minimum Activation Path problem, we are given a graph G with edge...
10/09/2019 ∙ by Sergio Cabello, et al. ∙ 0