Shortest bibranchings and valuated matroid intersection (Q1926655): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Valuated matroids: A new look at the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted matroid intersection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / 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: AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT" / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for minimum-weight bibranching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid intersection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection II: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices and matroids for systems analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Function on Generalized Polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Relations for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total dual integrality of matching forest constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof for the induction of M-convex functions through networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Matching Forests and Valuated Delta-Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank

Latest revision as of 01:23, 6 July 2024

scientific article
Language Label Description Also known as
English
Shortest bibranchings and valuated matroid intersection
scientific article

    Statements

    Shortest bibranchings and valuated matroid intersection (English)
    0 references
    0 references
    28 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest bibranching
    0 references
    arborescence
    0 references
    valuated matroidintersection
    0 references
    discrete convex function
    0 references
    0 references