Skip to main content
Log in

Algorithm Engineering

  • AKTUELLES SCHLAGWORT
  • ALGORITHM ENGINEERING
  • Published:
Informatik-Spektrum Aims and scope

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

Access this article

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

Instant access to the full article PDF.

References

  1. Bader DA, Meyerhenke H, Sanders P, Schulz C, Schumm A, Wagner D (2012) A benchmarking set for graph clustering and partitioning. In: Rokne J, Alhajj R (eds) Encyclopedia of Social Network Analysis and Mining. To appear

  2. Delling D, Goldberg AV and Werneck RF (2011) Shortest paths in road networks: from practice to theory and back. In: Sanders P, Wagner D (eds), it – Information Technology, Algorithm Enineering, vol 53, Oldenburg-Verlag, pp 294–301

  3. Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of Large and Complex Networks, LNCS State-of-the-Art Survey, vol 5515, Springer, pp 117–139

  4. Dementiev R, Sanders P, Schultes D, Sibeyn J (2004) Engineering an external memory minimum spanning tree algorithm. In: IFIP TCS, Toulouse, pp 195–208

  5. Downey RG, Fellows MR (1999) Parameterized Complexity. Springer

  6. Meyer U, Sanders P, Sibeyn J (eds) (2003) Algorithms for Memory Hierarchies. LNCS Tutorial, vol 2625, Springer

  7. Spielman DA, Teng S (2001) Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing (STOC), Heraklion, Crete, Greece, 6–8 July 2001, pp 296–305

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Sanders.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sanders, P., Wagner, D. Algorithm Engineering. Informatik Spektrum 36, 187–190 (2013). https://doi.org/10.1007/s00287-013-0684-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-013-0684-1

Navigation