A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.040 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976598820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbalanced Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cutting a few vertices from a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of Cutting a Few Vertices from a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / 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: Q5743436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria global minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing All Small Cuts in an Undirected Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Load Factors in Two-Processor Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank

Latest revision as of 05:34, 11 July 2024

scientific article
Language Label Description Also known as
English
A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
scientific article

    Statements

    A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (English)
    0 references
    0 references
    11 December 2015
    0 references
    unbalanced cut
    0 references
    Min \(s\)-\(t\) Cut
    0 references
    approximation algorithm
    0 references
    linear programming
    0 references
    network community
    0 references

    Identifiers

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