LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00312187" target="_blank" >RIV/68407700:21230/17:00312187 - isvavai.cz</a>
Result on the web
<a href="http://ieeexplore.ieee.org/document/7494684/" target="_blank" >http://ieeexplore.ieee.org/document/7494684/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TPAMI.2016.2582165" target="_blank" >10.1109/TPAMI.2016.2582165</a>
Alternative languages
Result language
angličtina
Original language name
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
Original language description
In our recent work, we showed that solving the LP relaxation of the pairwise min-sum labeling problem (also known as MAP inference in graphical models or discrete energy minimization) is not much easier than solving any linear program. Precisely, the general linear program reduces in linear time (assuming the Turing model of computation) to the LP relaxation of the min-sum labeling problem. The reduction is possible, though in quadratic time, even to the min-sum labeling problem with planar structure. Here we prove similar results for the pairwise min-sum labeling problem with attractive Potts interactions (also known as the uniform metric labeling problem).
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/LL1303" target="_blank" >LL1303: Large Scale Category Retrieval</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Pattern Analysis and Machine Intelligence
ISSN
0162-8828
e-ISSN
1939-3539
Volume of the periodical
39
Issue of the periodical within the volume
7
Country of publishing house
US - UNITED STATES
Number of pages
7
Pages from-to
1469-1475
UT code for WoS article
000402744400016
EID of the result in the Scopus database
2-s2.0-85020294999