Pages that link to "Item:Q3037462"
From MaRDI portal
The following pages link to NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS (Q3037462):
Displaying 13 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- An algebraic approach to shape-from-image problems (Q792776) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- On combinatorial structures of line drawings of polyhedra (Q2266021) (← links)
- Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
