Skip to main content
SpringerLink
Log in

Probabilistische Analyse am Beispiel des k-Zentrumsproblems

  • Conference paper
Informatik’99

Part of the book series: Informatik aktuell ((INFORMAT))

  • 80 Accesses

Zusammenfassung

Das Graduiertenkolleg „Algorithmische Diskrete Mathematik“ in Berlin wird vorgestellt. Es folgt eine Übersicht der Dissertation, die ich als Stipendiat des Graduiertenkollegs angefertigt und im März 1999 verteidigt habe. Das Thema liegt im Schnitt der Gebiete Graphenalgorithmen und probabilistische Methoden.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. I. Biehl. Eine Grundlegung der Average-Case Komplexitätstheorie. Teubner-Texte zur Informatik. Teubner, Stuttgart, 1996.

    Google Scholar 

  2. A. Frieze and C. McDiarmid. Algorithmic theory of random graphs. Random Structures é1 Algorithms, 10: 5–42, 1997.

    Article  MathSciNet  Google Scholar 

  3. G. Grimmett and C. McDiarmid. On colouring random graphs. Proceedings of the Cambridge Philosophical Society, 77: 313–324, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  4. D. Hochbaum, editor. Approximation algorithms for NP-hard problems. PWS Publishers, Boston, 1996.

    MATH  Google Scholar 

  5. D. Hochbaum and D. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10 (2): 180–184, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  6. C. McDiarmid. Colouring random graphs. Annals of Operations Research, 1: 183200, 1984.

    Google Scholar 

  7. T. Nierhoff. The k-Center Problem and r-Independent Sets. Dissertation, Humboldt-Universität zu Berlin, 1999.

    Google Scholar 

  8. H. J. Prömel and A. Steger. Coloring clique-free graphs in linear expected time. Random Structures and Algorithms, 3 (4): 375–402, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  9. H. Wilf. Backtrack: An O(1) expected time algorithm for the graph coloring problem. Information Processing Letters, 18: 119–121, 1984.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Humboldt-Universität zu Berlin, D-10099, Berlin, Deutschland

    Till Nierhoff

Authors
  1. Till Nierhoff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. HNF Heinz Nixdorf MuseumsForum GmbH, Fürstenallee 7, 33102, Paderborn, Deutschland

    Kurt Beiersdörfer

  2. FB Mathematik/Informatik, Universität Paderborn, 33095, Paderborn, Deutschland

    Gregor Engels  & Wilhelm Schäfer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nierhoff, T. (1999). Probabilistische Analyse am Beispiel des k-Zentrumsproblems. In: Beiersdörfer, K., Engels, G., Schäfer, W. (eds) Informatik’99. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-01069-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-01069-3_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66450-5

  • Online ISBN: 978-3-662-01069-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation