NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
From MaRDI portal
Publication:3037462
DOI10.15807/jorsj.26.186zbMath0524.05025OpenAlexW2182926040MaRDI QIDQ3037462
Publication date: 1983
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1137a9a14866433eca50a770b71d19024059c2d1
Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Extended formulations for sparsity matroids, A faster algorithm for computing the principal sequence of partitions of a graph, Generalized polymatroids and submodular flows, Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach, Packing of arborescences with matroid constraints via matroid intersection, On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition, Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders, On the tractability of some natural packing, covering and partitioning problems, Forests, frames, and games: Algorithms for matroid sums and applications, A rooted-forest partition with uniform vertex demand, On combinatorial structures of line drawings of polyhedra, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, Extended formulations of lower-truncated transversal polymatroids, An algebraic approach to shape-from-image problems
