Approximating optimum branchings in linear time (Q976065): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximate maximum weight branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple derivation of edmonds' algorithm for optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank

Latest revision as of 22:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximating optimum branchings in linear time
scientific article

    Statements

    Approximating optimum branchings in linear time (English)
    0 references
    0 references
    16 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    graph algorithm
    0 references
    branching
    0 references
    0 references