All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00230198" target="_blank" >RIV/68407700:21230/15:00230198 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-14612-6_5" target="_blank" >http://dx.doi.org/10.1007/978-3-319-14612-6_5</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-14612-6_5" target="_blank" >10.1007/978-3-319-14612-6_5</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    How Hard Is the LP Relaxation of the Potts Min-Sum Labeling Problem?

  • Original language description

    An important subclass of the min-sum labeling problem (also known as discrete energy minimization or valued constraint satisfaction) is the pairwise min-sum problem with arbitrary unary costs and attractive Potts pairwise costs (also known as the uniformmetric labeling problem). In analogy with our recent result, we show that solving the LP relaxation of the Potts min-sum problem is not significantly easier than that of the general min-sum problem and thus, in turn, the general linear program. This suggests that trying to find an efficient algorithm to solve the LP relaxation of the Potts min-sum problem has a fundamental limitation. Our constructions apply also to integral solutions, yielding novel reductions of the (non-relaxed) general min-sum problem to the Potts min-sum problem.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2015

  • 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

  • Article name in the collection

    EMMCVPR 2015: Proceedings of the 10th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition

  • ISBN

    978-3-319-14611-9

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    14

  • Pages from-to

    57-70

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Hong Kong

  • Event date

    Jan 13, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000357502000005