Pages that link to "Item:Q5918917"
From MaRDI portal
The following pages link to An efficient characterization of submodular spanning tree games (Q5918917):
Displaying 6 items.
- Submodularity of some classes of the combinatorial optimization games (Q1423711) (← links)
- On the population monotonicity of independent set games (Q2084006) (← links)
- On the convexity of independent set games (Q2659079) (← links)
- Thick Subtrees, Games and Experiments (Q3637187) (← links)
- A branch-and-cut algorithm for submodular interdiction games (Q6364047) (← links)
- Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)