An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1080/02331934.2011.592527 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169649212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for max<i>k</i>-uncut with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:39, 5 July 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for max<i>k</i>-uncut with capacity constraints
scientific article

    Statements

    An approximation algorithm for max<i>k</i>-uncut with capacity constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Max \(k\)-uncut
    0 references
    capacity constraints
    0 references
    local search
    0 references
    unbalanced partition
    0 references
    0 references