Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm for the resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random pseudo-polynomial algorithms for exact matroid problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polymatroids and submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroid intersection adjacency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Network Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time scheduling with a budget / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of restricted spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / 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: Q3140449 / rank
 
Normal rank

Latest revision as of 10:33, 28 June 2024

scientific article
Language Label Description Also known as
English
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
scientific article

    Statements

    Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2008
    0 references

    Identifiers