The \(t\)-discrepancy of a poset

DOI10.1016/j.dam.2010.07.010zbMath1201.06001OpenAlexW2009857150MaRDI QIDQ602757

Ann N. Trenk, David M. Howard

Publication date: 5 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.07.010

zbMATH Keywords

linear discrepancyranking poset pointsweak discrepancy

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(k\)-weak orders: Recognition and a tolerance result
• Linear discrepancy and weak discrepancy of partially ordered sets
• Linear discrepancy and bandwidth
• The Roberts characterization of proper and unit interval graphs
• A characterization of partially ordered sets with linear discrepancy equal to \(2\)
• Linear discrepancy of the product of two chains
• On the Weakness of an Ordered Set

This page was built for publication: The \(t\)-discrepancy of a poset