The following pages link to Rado's theorem for polymatroids (Q4083682):
Displaying 20 items.
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- Optimal matchings in posets (Q792355) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Matroid matching and some applications (Q1144584) (← links)
- A geometric theory of hypergraph colouring (Q1188297) (← links)
- Bi-submodular functions, distributive valuations, and distance functions in lattices (Q1227634) (← links)
- Blocking, antiblocking, and pairs of matroids and polymatroids (Q1255012) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty (Q2157911) (← links)
- Clinching auctions with online supply (Q2206820) (← links)
- A splitter theorem for 3-connected 2-polymatroids (Q2420565) (← links)
- Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405) (← links)
- A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids (Q2797091) (← links)
- k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions (Q3322709) (← links)
- On the subdifferential of a submodular function (Q3332786) (← links)
- Polyhedral Clinching Auctions for Two-Sided Markets (Q5076699) (← links)
