ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing membership in matroid polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polymatroids and submodular flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Kelso and Crawford's Gross Substitutes Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuated Matroid Intersection I: Optimality Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex 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: Extension of M-convexity and L-convexity to polyhedral convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization. Polyhedra and efficiency. CD-ROM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank

Latest revision as of 16:25, 1 July 2024

scientific article
Language Label Description Also known as
English
ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
scientific article

    Statements

    ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (English)
    0 references
    0 references
    23 June 2009
    0 references
    matroid
    0 references
    concave function
    0 references

    Identifiers