Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem (Q633844): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549696 / 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: Q4763403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new and improved algorithm for the 3-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing minimum 3-way and 4-way cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy splitting algorithms for approximating multiway partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized greedy splitting algorithms for multiway partition problems / rank
 
Normal rank

Revision as of 21:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
scientific article

    Statements

    Identifiers

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