A minimax theorem on intervals
From MaRDI portal
Publication:801077
DOI10.1016/0095-8956(84)90039-XzbMath0551.05035OpenAlexW2039977337MaRDI QIDQ801077
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90039-x
Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items (10)
On minimally non-firm binary matrices ⋮ Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ A Survey on Covering Supermodular Functions ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ A weighted min-max relation for intervals ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ An algorithm to increase the node-connectivity of a digraph by one ⋮ A note on the contractions for orthogonal polygons ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Covering simply connected regions by rectangles
Cites Work
This page was built for publication: A minimax theorem on intervals
