Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems: [Extended Abstract]

DOI10.1137/1.9781611973105.127zbMath1423.90224OpenAlexW2490902856MaRDI QIDQ5741836

Hiroshi Hirai

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.127

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Distance in graphs (05C12)

Related Items (1)

The Power of Linear Programming for General-Valued CSPs

This page was built for publication: Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems: [Extended Abstract]