Skip to main content
SpringerLink
Log in

Orienting Dart-free Clique-Helly Chordal Graphs

  • Conference paper
Operations Research Proceedings 1999

Part of the book series: Operations Research Proceedings 1999 ((ORP,volume 1999))

  • 370 Accesses

Summary

In this paper we acyclic orient dart-free clique-Helly chordal graphs in which each directed path is contained in at most two maximal cliques. As shown by the authors in previous works, this allows to give performance guarantee approximation results on a wide class of optimization problems.

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 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 132.00
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.J. Bandelt and E. Prisner, Clique graphs and Helly graphs, J. Comb. Theory B, 51, (1991) 34–35.

    Article  Google Scholar 

  2. E.G. Coffman, An Introduction to Combinatorial Models of Dynamic Storage Allocation, SIAM Review, 25, (1983) 311–325.

    Article  Google Scholar 

  3. G. Confessore, P. Dell’Olmo and S. Giordani, An Approximation Result for a Bandwidth Allocation Problem, in: P. Kischka et al. (eds.), Operations Research Proc. 1997, (Springer 1998) 126–131.

    Google Scholar 

  4. G. Confessore, P. Dell’Olmo and S. Giordani, Partitioning Cliques of Claw-Free Strongly Chordal Graphs, in: P. Kall and H.J. Lüthi (eds.), Operations Research Proc. 1998, (Springer 1999) 142–151.

    Google Scholar 

  5. G. Confessore, P. Dell’Olmo and S. Giordani, Vertex Partitioning of Crown-free Interval Graphs, in: P. Widmayer (ed.), Proc. of 25 th Workshop on Graph-theoretic Concepts in Computer Science — WG 99, Lecture Notes in Computer Science, (Springer 1999) in press.

    Google Scholar 

  6. P. Dell’Olmo, M.G. Speranza and Zs. Tuza, Comparability Graph Augmentation for some Multiprocessor Scheduling Problems, Discr. Appl. Math., 72, (1997) pp. 71–84.

    Article  Google Scholar 

  7. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, (Academic Press, N.Y., 1980).

    Google Scholar 

  8. L. Sun, Two Classes of Perfect Graphs, J. Comb. Theory B, 53, (1991) 273–291.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Rome “Tor Vergata”, I.T.I.A. — C.N.R., Italy

    Giuseppe Confessore

  2. University of Rome “La Sapienza”, Italy

    Paolo Dell’Olmo

  3. University of Rome “Tor Vergata”, Italy

    Stefano Giordani

Authors
  1. Giuseppe Confessore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paolo Dell’Olmo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefano Giordani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Wirtschaftswissenschaft, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Karl Inderfurth  & Gerhard Schwödiauer  & 

  2. Fachbereich Rechts- und Wirtschaftswissenschaften, Technische Universität Darmstadt, Hochschulstr. 1, D-64289, Darmstadt, Germany

    Wolfgang Domschke

  3. Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Friedrich Juhnke

  4. Wirtschaftswissenschaftliche Fakultät, Universität Passau, Innstr. 29, D-90030, Passau, Germany

    Peter Kleinschmidt

  5. Wirtschaftswissenschaftliche Fakultät, Martin-Luther-Universität Halle-Wittenberg, Große Steinstr. 73, D-06108, Halle/Saale, Germany

    Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Confessore, G., Dell’Olmo, P., Giordani, S. (2000). Orienting Dart-free Clique-Helly Chordal Graphs. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58300-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67094-0

  • Online ISBN: 978-3-642-58300-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation