Minimizing Setups for Cycle-Free Ordered Sets
From MaRDI portal
Publication:3960747
DOI10.2307/2044053zbMath0497.06002MaRDI QIDQ3960747
Peter M. Winkler, Dwight Duffus, Ivan Rival
Publication date: 1982
Full work available at URL: https://doi.org/10.2307/2044053
Related Items
NP-completeness properties about linear extensions, Minimizing setups in ordered sets of fixed width, Jump number of dags having Dilworth number 2, A 3/2-approximation algorithm for the jump number of interval orders, Jump number problem: The role of matroids, An algorithm for minimizing setups in precedence constrained scheduling, Chordal bipartite graphs and crowns, Interval orders without odd crowns are defect optimal, A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders, On finding the jump number of a partial order by substitution decomposition, Greedy posets for the bump-minimizing problem, Minimizing bumps for posets of width two, On minimizing jumps for ordered sets, Cycle-free partial orders and chordal comparability graphs, A greedy reduction algorithm for setup optimization, The jump number of Z-free ordered sets, Maximum and minimum jump number of posets from matrices, On a setup optimization problem for interval orders, Some new explorations into the mystery of time and band limiting, Semantic networks, Alternating cycle-free matchings, On the poset of all posets on \(n\) elements, Split orders, An improved algorithm for the jump number problem, Obituary: Ivan Rival, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, Minimizing Setups for Ordered Sets: A Linear Algebraic Approach, Optimal Linear Extensions by Interchanging Chains
Cites Work
