Skip to main content
SpringerLink
Log in

Tackling the jump number of interval orders

  • Published:
Order Aims and scope Submit manuscript

Abstract

Although the jump number problem for partially ordered sets in NP-complete in general, there are some special classes of posets for which polynomial time algorithms are known.

Here we prove that for the class of interval orders the problem remains NP-complete. Moreover we describe another 3/2-approximation algrithm (two others have been developed already by Felsner and Syslo, respectively) by using a polynomial time subgraph packing algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. P.Bogart (1982) Some social science applications of ordered sets, in I.Rival (ed.), Ordered Sets, Reidel, Dordrecht, 759–787.

    Google Scholar 

  2. V.Bouchitté and M.Habib (1987) NP-completeness properties about linear extensions, Order 4, 143–154.

    Google Scholar 

  3. V.Bouchitté and M.Habib (1989) The calculations of invariants for ordered sets, in I.Rival (ed.), Algorithms and Order, Kluwer Academic Publishers, Dordrecht, 231–279.

    Google Scholar 

  4. G.Cornuéjols, D.Hartvigsen, and W.Pulleyblank (1982) Packing subgraphs in a graph, Operations Research Letters 1, 139–143.

    Google Scholar 

  5. U.Faigle and R.Schrader (1987) Interval orders without odd crowns are defect optimal, Computing 38, 59–69.

    Google Scholar 

  6. S.Felsner (1990) A 3/2-approximation algorithm for the jump number of interval orders, Order 6, 325–334.

    Google Scholar 

  7. P. C.Fishburn (1985) Interval Orders and Interval Graphs, Wiley, New York.

    Google Scholar 

  8. M.Garey and D.Johnson (1979) Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco.

    Google Scholar 

  9. G.Gierz and W.Poguntke (1983) Minimizing setups for ordered sets: A linear algebraic approach, SIAM J. Alg. Disc. Meth. 4, 132–144.

    Google Scholar 

  10. L.Lovász and M. D.Plummer (1983) Matching theory, Annals of Discrete Mathematics 29, 357–382.

    Google Scholar 

  11. R. H.Möhring (1989) Computationally tractable classes of ordered sets, in I.Rival (ed.), Algorithms and Order, Kluwer Academic Publishers, Dordrecht, 105–193.

    Google Scholar 

  12. W. Pulleyblank (1982) On minimizing setups in precedence constrained scheduling. Unpublished manuscript.

  13. K.Reuter (1991) The jump number and the lattice of maximal antichains. Discrete Mathematics 88, 289–307.

    Article  Google Scholar 

  14. M. M. Syslo (1990) The jump number problem on interval orders: A 3/2-approximation algorithm, Preprint.

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Technische Hochschule Darmstadt, W-6100, Darmstadt, Germany

    Jutta Mitas

Authors
  1. Jutta Mitas
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by I. Rival

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mitas, J. Tackling the jump number of interval orders. Order 8, 115–132 (1991). https://doi.org/10.1007/BF00383398

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00383398

AMS subject classifications (1991)

Key words

Search

Navigation