A weighted min-max relation for intervals

DOI10.1016/0095-8956(91)90073-SMaRDI QIDQ1186133zbMATH OpenFDO

Authors Anna Lubiw

Publication date 28 June 1992

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

intervalsindependent setredundancy functiontotally balanced matrixindependent sequencemin-max formulaBoolean basis problemrectangle cover problemweighted min-max relation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Linear programming (90C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of packing and covering (05B40)

Recommendations

• A minimax theorem on intervals
• Inequalities connected with weighted minimax series
• Minimax theorems for interval spaces
• A note on weighted maximal inequalities
• scientific article; zbMATH DE number 4084333
• Interval extropy and weighted interval extropy
• Weighted inequalities and extrapolation
• scientific article; zbMATH DE number 218790
• Interpolation inequalities with weights
• Weighted inequalities for the numerical radius

Cites work

• scientific article; zbMATH DE number 3862930 (Why is no real title available?)
• scientific article; zbMATH DE number 3904331 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3231593 (Why is no real title available?)
• A minimax theorem on intervals
• An algorithm for covering polygons with rectangles
• Covering Regions by Rectangles
• Doubly Lexical Orderings of Matrices
• Finding Augmented-Set Bases
• Strong unimodularity for matrices and hypergraphs
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• Totally-Balanced and Greedy Matrices

Cited in

(11)

• Finding minimum generators of path systems
• Jump number of two-directional orthogonal ray graphs
• Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
• Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
• Covering, hitting, piercing and packing rectangles intersecting an inclined line
• Independent sets and hitting sets of bicolored rectangular families
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Covering and packing of triangles intersecting a straight line
• Max point-tolerance graphs
• Problems and invariants connected with bicliques and multicliques of graphs
• Extremal sets of the family of intervals

This page was built for publication: A weighted min-max relation for intervals

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