An improved approximation algorithm for requirement cut (Q991474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2010.02.009 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The multi-multiway cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner k-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Steiner and Directed Multicuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for requirement cut on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2010.02.009 / rank
 
Normal rank

Latest revision as of 11:30, 10 December 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for requirement cut
scientific article

    Statements

    Identifiers