Research map / Learning theory and algorithms / Combinatorial and search optimization
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
Daniel Průša, Tomáš Werner
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation (AAAI 2018 · similarity 0.89)
- Maximum Persistency via Iterative Relaxed Inference in Graphical Models (TPAMI 2017 · similarity 0.88)
- Partial Optimality by Pruning for MAP-Inference with General Graphical Models (TPAMI 2016 · similarity 0.88)
- Rounding-based Moves for Semi-Metric Labeling (JMLR 2016 · similarity 0.87)
- Solving Relaxations of MAP-MRF Problems: Combinatorial In-Face Frank-Wolfe Directions (CVPR 2023 · similarity 0.87)
- MAP Inference Via $$\ell _2$$-Sphere Linear Program Reformulation (IJCV 2020 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
