A weighted min-max relation for intervals
From MaRDI portal
Publication:1186133
DOI10.1016/0095-8956(91)90073-SzbMath0758.05003MaRDI QIDQ1186133
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
intervalsindependent settotally balanced matrixredundancy functionindependent sequencemin-max formulaBoolean basis problemrectangle cover problemweighted min-max relation
Linear programming (90C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40)
Related Items (10)
Unnamed Item ⋮ Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line ⋮ Max point-tolerance graphs ⋮ Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Independent sets and hitting sets of bicolored rectangular families ⋮ Covering and packing of triangles intersecting a straight line ⋮ Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs ⋮ Finding minimum generators of path systems ⋮ Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimax theorem on intervals
- Strong unimodularity for matrices and hypergraphs
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
- Totally-Balanced and Greedy Matrices
- An algorithm for covering polygons with rectangles
- Doubly Lexical Orderings of Matrices
- Finding Augmented-Set Bases
- Covering Regions by Rectangles
This page was built for publication: A weighted min-max relation for intervals