An algorithm for solving the jump number problem

DOI10.1016/0012-365X(88)90224-5zbMath0662.06001MaRDI QIDQ1113927

Maciej M. Sysło

Publication date: 1988

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

zbMATH Keywords

arc diagramdigraph ordersequencing of posets

Mathematics Subject Classification ID

Partial orders, general (06A06) Searching and sorting (68P10) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

On some new types of greedy chains and greedy linear extensions of partially ordered sets ⋮ The jump number problem on interval orders: A 3/2 approximation algorithm ⋮ An improved approximation ratio for the jump number problem on interval orders ⋮ The arboreal jump number of an order ⋮ An improved algorithm for the jump number problem

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing setups in ordered sets of fixed width
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• On some complexity properties of N-free posets and posets with bounded decomposition diameter
• Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II
• On some new types of greedy chains and greedy linear extensions of partially ordered sets
• Optimal Linear Extensions by Interchanging Chains

This page was built for publication: An algorithm for solving the jump number problem