Matroid rank functions and discrete concavity
From MaRDI portal
Publication:1926653
DOI10.1007/S13160-012-0082-0zbMATH Open1254.90196OpenAlexW2073872397MaRDI QIDQ1926653FDOQ1926653
Publication date: 28 December 2012
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-012-0082-0
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete Convex Analysis
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Submodular functions and optimization.
- Combinatorial auctions with decreasing marginal utilities
- Generalized polymatroids and submodular flows
- Valuated matroids
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- \(M\)-convex function on generalized polymatroid
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Verifying gross substitutability.
- Discrete convex analysis
- From convex optimization to randomized mechanisms
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
- Revenue submodularity
- Limitations of Randomized Mechanisms for Combinatorial Auctions
Cited In (8)
- Logarithmic concavity for morphisms of matroids
- On the Construction of Substitutes
- Lorentzian polynomials
- First order convergence of matroids
- Theta rank, levelness, and matroid minors
- Valuated matroid-based algorithm for submodular welfare problem
- Rank functions of strict cg-matroids
- Title not available (Why is that?)
This page was built for publication: Matroid rank functions and discrete concavity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926653)
