Skip to main content
SpringerLink
Log in

Linear Arrangement Problems and Interval Graphs

  • Conference paper
  • First Online:
Combinatorial Optimization (ISCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8596))

Included in the following conference series:

  • 1187 Accesses

Abstract

We present in this paper new results on the Linear Arrangement Problem (LAP) for interval graphs. We first propose a new lower bounding scheme, which links LAP with the Max-Cut Problem, and then show that this lower bound is tight for unit interval graphs. Next, we focus on arbitrary interval graphs, and derive a polynomial time approximation algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Achouri, S., Bossart, T., Munier-Kordon, A.: A polynomial algorithm for MINDSC on a subclass of series parallel graphs. RAIRO Oper. Res. 43(2), 145–156 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Prog. 36, 157–173 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  3. Charon, I., Hudry, O.: An updated survey on the linear ordering problem for weighted or unweighted tournaments. Ann. Oper. Res. 175, 107–158 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chung, F.R.K.: On optimal linear arrangement of trees. Comp. Math./Appl. 11, 43–60 (1984)

    Article  Google Scholar 

  5. Cohen, J., Fomin, F.V., Heggernes, P., Kratsch, D., Kucherov, G.: Optimal linear arrangement of interval graphs. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 267–279. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Corneil, D.G., Kim, H., Natarajan, S., Olarin, S., Sprague, A.P.: A simple linear time algorithm of unit interval graphs. Inf. Process. Lett. 55, 99–104 (1995)

    Article  MATH  Google Scholar 

  7. Chvatal, V., Ebenegger, C.: A note on line digraphs and the directed Max-Cut problem. Discret. Appl. Math. 29, 165–170 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Even, S., Shiloach, Y.: NP-Completeness of Several Arrangement Problems, Technical Report #43, Computer Science Department, The Technion, Haifa, Israel (1975)

    Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1979) (Computer Press)

    Google Scholar 

  10. Grotschel, M. (ed.): The Sharpest Cut, MPS-SIAM Series on Optimization. SIAM, Philadelphia (2004)

    Google Scholar 

  11. Horton, S.B.: The optimal linear arrangement problem: algorithms and approximation. Ph.D. Thesis, Georgia Institute of Technology (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIMOS, UMR CNRS, Université Blaise Pascal, 6158, Clermont Ferrant, France

    Alain Quilliot

  2. Département d’Informatique et Mathématique, Université du Québec à Chicoutimi, Saguenay, QC, G7H 2B1, Canada

    Djamal Rebaine

Authors
  1. Alain Quilliot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Djamal Rebaine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alain Quilliot .

Editor information

Editors and Affiliations

  1. Univ Pierre et Marie Curie LIP6, Paris, France

    Pierre Fouilhoux

  2. Universidade de Lisboa, Lisbon, Portugal

    Luis Eduardo Neves Gouveia

  3. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    A. Ridha Mahjoub

  4. LAMSADE, Université Paris-Dauphine, Paris Cedex 16, France

    Vangelis T. Paschos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Quilliot, A., Rebaine, D. (2014). Linear Arrangement Problems and Interval Graphs. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09174-7_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09173-0

  • Online ISBN: 978-3-319-09174-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation