Complexity and approximability of \(k\)-splittable flows (Q861276): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-splittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank

Latest revision as of 12:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Complexity and approximability of \(k\)-splittable flows
scientific article

    Statements

    Complexity and approximability of \(k\)-splittable flows (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references