NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS

DOI10.15807/JORSJ.26.186MaRDI QIDQ3037462zbMATH OpenOpenAlexFDO

Authors Hideki Imai

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

zbMATH Keywords

combinatorial optimizationnetwork flow algorithmspolymatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Deterministic network models in operations research (90B10)

Cited in

(13)

• Generalized polymatroids and submodular flows
• Forests, frames, and games: Algorithms for matroid sums and applications
• Packing of arborescences with matroid constraints via matroid intersection
• On combinatorial structures of line drawings of polyhedra
• Extended formulations for sparsity matroids
• On the tractability of some natural packing, covering and partitioning problems
• Extended formulations of lower-truncated transversal polymatroids
• Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
• A rooted-forest partition with uniform vertex demand
• An algebraic approach to shape-from-image problems
• A faster algorithm for computing the principal sequence of partitions of a graph

This page was built for publication: NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3037462)