Pages that link to "Item:Q1061150"

The following pages link to Greedy linear extensions to minimize jumps (Q1061150):

Displaying 21 items.

• NP-completeness properties about linear extensions (Q581427) (← links)
• The jump number of suborders of the power set order (Q583248) (← links)
• Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
• Inequalities for the greedy dimensions of ordered sets (Q1065837) (← links)
• An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
• Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
• Constructing greedy linear extensions by interchanging chains (Q1087566) (← links)
• NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← links)
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
• Greedy posets for the bump-minimizing problem (Q1097902) (← links)
• Substitution and atomic extension on greedy posets (Q1104347) (← links)
• On minimizing the jump number for interval orders (Q1111581) (← links)
• The jump number of Z-free ordered sets (Q1183946) (← links)
• On the poset of all posets on \(n\) elements (Q1326745) (← links)
• Greedy linear extensions with constraints (Q1821122) (← links)
• Obituary: Ivan Rival (Q1826506) (← links)
• On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
• Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
• Linear extensions of N-free orders. (Q2351714) (← links)
• Orders with level diagrams (Q2640624) (← links)
• Bounds for the jump number of partially ordered sets (Q3976789) (← links)