Minimum 0-Extension Problems on Directed Metrics
Hiroshi Hirai, Ryuhei Mizutani

TL;DR
This paper extends the classification of the minimum 0-extension problem to directed metrics, identifying conditions for NP-hardness and tractability, and establishing a dichotomy for star metrics.
Contribution
It introduces a directed version of the 0-extension problem, extending NP-hardness conditions, and provides new tractability results and a dichotomy for specific metric cases.
Findings
NP-hardness if the metric cannot be represented as a shortest path metric of an orientable modular graph
Tractability when the metric is from a modular lattice with an orbit-invariant directed edge-length
Dichotomy established for the case where the metric is from a star
Abstract
For a metric on a finite set , the minimum 0-extension problem 0-Ext is defined as follows: Given and , minimize subject to , where the sum is taken over all unordered pairs in . This problem generalizes several classical combinatorial optimization problems such as the minimum cut problem or the multiterminal cut problem. Karzanov and Hirai established a complete classification of metrics for which 0-Ext is polynomial time solvable or NP-hard. This result can also be viewed as a sharpening of the general dichotomy theorem for finite-valued CSPs (Thapper and \v{Z}ivn\'{y} 2016) specialized to 0-Ext. In this paper, we consider a directed version -Ext of the minimum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
