Minimizing Setups for Ordered Sets: A Linear Algebraic Approach

DOI10.1137/0604016zbMATH Open0517.06004OpenAlexW1988363261MaRDI QIDQ3665161FDOQ3665161

Authors: Gerhard Gierz, Werner Poguntke 

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604016

zbMATH Keywords

incidence matrixlinear extensioncycle-series-parallel ordered setssetup number of finite ordered set

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Complexity of Scheduling under Precedence Constraints
• Minimizing Setups for Cycle-Free Ordered Sets
• Title not available (Why is that?)
• The Jump Number of Dags and Posets: An Introduction
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

• Optimal Linear Extensions by Interchanging Chains
• Greedy balanced pairs in \(N\)-free ordered sets
• N-free posets as generalizations of series-parallel posets
• Substitution and atomic extension on greedy posets
• The jump number of suborders of the power set order
• Tackling the jump number of interval orders
• On finding the jump number of a partial order by substitution decomposition
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
• Greedy posets for the bump-minimizing problem
• Random graph orders
• The communication complexity of interval orders
• An algorithm for minimizing setups in precedence constrained scheduling
• The jump number and the lattice of maximal antichains
• Jump number problem: The role of matroids
• Interval orders without odd crowns are defect optimal
• On some complexity properties of N-free posets and posets with bounded decomposition diameter

This page was built for publication: Minimizing Setups for Ordered Sets: A Linear Algebraic Approach

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