Abstract
Abstract The jump number problem for posets is to find a linear extension in which the number of incomparable adjacent pairs is minimized. In this paper the class of interval orders is considered. Three 3/2-approximation algorithms for this problem have been known for some time. By a previous work of Mitas, the problem may be reformulated as a subgraph packing task. We prove that the problem reduces also to a set cover task, and we establish an improved bound of 1.484 to the approximation ratio of the jump number on interval orders.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
