When linear and weak discrepancy are equal
From MaRDI portal
Publication:626763
DOI10.1016/j.disc.2010.11.003zbMath1219.06002OpenAlexW2096242104MaRDI QIDQ626763
David M. Howard, Stephen J. Young
Publication date: 18 February 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.11.003
Partial orders, general (06A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Forbidden subposets for fractional weak discrepancy at most \(k\)
- Irreducible width 2 posets of linear discrepancy \(3\)
- Linear discrepancy and weak discrepancy of partially ordered sets
- Linear discrepancy and bandwidth
- Can transitive orientation make sandwich problems easier?
- The fractional weak discrepancy of a partially ordered set
- A characterization of partially ordered sets with linear discrepancy equal to \(2\)
- Intransitive indifference with unequal indifference intervals
- On the Weakness of an Ordered Set
This page was built for publication: When linear and weak discrepancy are equal