Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for the minimum coloring cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for label cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete particle swarm optimization for the minimum labelling Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled traveling salesman problems: complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of some minimum label problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Contractions and Sampling for Hypergraph and Hedge Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for labeled connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph cuts with interacting edge weights: examples, approximations, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The labeled perfect matching in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for Components and Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Label s-t Cut via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Colorful Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and hardness results for label cut and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The label cut problem with respect to path length and label frequency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem / rank
 
Normal rank

Latest revision as of 05:43, 24 July 2024

scientific article
Language Label Description Also known as
English
Minimum label \(s\)-\(t\) cut has large integrality gaps
scientific article

    Statements

    Minimum label \(s\)-\(t\) cut has large integrality gaps (English)
    0 references
    0 references
    0 references
    15 December 2020
    0 references
    label \(s\)-\(t\) cut
    0 references
    minimum \(s-t\) cut
    0 references
    linear programming
    0 references
    integrality gap
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references