scientific article; zbMATH DE number 7559417
From MaRDI portal
Publication:5089214
DOI10.4230/LIPIcs.MFCS.2020.46MaRDI QIDQ5089214
Hiroshi Hirai, Ryuhei Mizutani
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityvalued constraint satisfaction problemsdirected metricsminimum \(0\)-extension problems
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight spans of distances and the dual fractionality of undirected multiflow problems
- Networks with Condorcet solutions
- Metrics with finite sets of primitive extensions
- Minimum 0-extensions of graph metrics
- Hard cases of the multifacility location problem
- A multifacility location problem on median spaces
- One more well-solved case of the multifacility location problem
- The Complexity of Finite-Valued CSPs
- Folder Complexes and Multiflow Combinatorial Dualities
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Modular Interval Spaces
- The Complexity of Multiterminal Cuts
- The Complexity of Valued Constraint Satisfaction Problems
- The Power of Linear Programming for General-Valued CSPs
- Discrete convexity and polynomial solvability in minimum 0-extension problems
This page was built for publication:
