Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3327527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex partitioning via exponential clocks and the multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm of MULTIWAY CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for a geometric embedding of minimum multiway cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Graph Homomorphism Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of homophyly of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiway cut, pairwise realizable distributions, and descending thresholds / rank
 
Normal rank

Latest revision as of 23:17, 10 July 2024

scientific article
Language Label Description Also known as
English
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
scientific article

    Statements

    Identifiers

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