Skip to main content
SpringerLink
Log in

Deutsch-indische Kooperation im Algorithm Engineering

  • HAUPTBEITRAG
  • KOOPERATION IM ALGORITHM ENGINEERING
  • Published:
Informatik-Spektrum Aims and scope

Zusammenfassung

Als erstes Schwerpunktprogramm bekommt das DFG SPP 1307 ,,Algorithm Engineering“ durch deutsch-indische Projekte eine binationale Komponente. Die Zusammenarbeit in der 3. Phase des Schwerpunktprogrammes umfasst Optimierung im Schienenverkehr, Berechnungen unter Unsicherheiten, Algorithmen für Datenströme und parallele quantum-evolutionäre Algorithmen.

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.

References

  1. Alon N, Matias Y, Szegedy M (1999) The space complexity of approximating the frequency moments. J Comput Syst Sci 58:137–147. Conference version at STOC 1996.

    Google Scholar 

  2. Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Tech. rep., Carnegie Mellon University, Pittsburgh, PA

  3. Bansal N (2010) Constructive algorithms for discrepancy minimization. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, Nevada, USA, October 2010 (FOCS 2010), 3–10

  4. Bhuvanagiri L, Ganguly S, Kesh D, Saha C (2006) Simpler algorithm for estimating frequency moments of data streams. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, USA, January 2006 (SODA 2006), 708–713

  5. Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science, vol 5515, 117–139

  6. Doerr B, Hota AR, Kötzing T (2012) Ants easily solve stochastic shortest path problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, Philadelphia, USA, July 2012 (GECCO 2012), 17–24

  7. Eggert S, Kliemann L, Munstermann P, Srivastav A (2012) Bipartite matching in the semi-streaming model. Algorithmica 63:490–508, doi: 10.1007/s00453-011-9556-8. Document ID: 519a88bb-5f5a-409d-8293-13cd80a66b36. Published online August 2011. Conference version in proceedings of ESA 2009

    Article  MathSciNet  MATH  Google Scholar 

  8. Goerigk M, Schöbel A (2011) A scenario-based approach for robust linear optimization. In: Proceedings of the 1st International ICST Conference on Practice and Theory of Algorithms in (Computer) Systems, Rome, Italy, April 2012 (TAPAS 2012), 139–150

  9. Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6(6):580–593, doi: 10.1109/TEVC.2002.804320

    Article  Google Scholar 

  10. Harik GR, Lobo FG, Goldberg DE (1997) The compact genetic algorithm. Tech. rep., University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL

  11. Kliemann L (2011) Matching in bipartite graph streams in a small number of passes (extended abstract). In: Proceedings of the 10th International Symposium on Experimental and Efficient Algorithms, Kolimpari, Chania, Crete, Greece, May 2011 (SEA 2011), 254–266, doi: 10.1007/978-3-642-20662-7_22. Document ID: dda51148-ac5b-4655-9c4f-e01f26511235

  12. Liebchen C, Schachtebeck M, Schöbel A, Stiller S, Prigge A (2010) Computing delay resistant railway timetables. Comput Operat Res 37:857–868

    Article  MATH  Google Scholar 

  13. Mani A, Patvardhan C (2010) A hybrid quantum evolutionary algorithm for solving engineering optimization problems. Int J Hybrid Intel Syst 7:225–235

    MATH  Google Scholar 

  14. Matoušek J, Spencer J (1996) Discrepancy in arithmetic progressions. J Am Math Soc 9:195–204, http://www.jstor.org/stable/2152845, last access 5.2.2013

    Article  MATH  Google Scholar 

  15. Muralidhara VN, Sen S (2010) The covert set cover problem with application to network discovery. In: Proceedings of the 4th International Workshop on Algorithms and Computation, Dhaka, Bangladesh, India, February 2010 (WALCOM 2010), 228–239

  16. Nagarajan V, Ranade A (2008) Exact train pathing. J Schedul 11(4):279–297

    Article  MathSciNet  MATH  Google Scholar 

  17. Patvardhan C, Prakash P, Srivastav A (2009) A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. In: Proceedings of the International Conference on Operations Research Applications in Engineering and Management, Tiruchirappalli, India, May 2009 (ICOREM 2009), 2061–2064. Best OR Application in Engineering Award, sponsored by the Anna University, Tiruchirappalli. Accepted at the International Journal of Mathematics in Operations Research

  18. Roth KF (1964) Remark concerning integer sequences. Acta Arith 9:257–260

    MathSciNet  MATH  Google Scholar 

  19. Schöbel A (2009) Capacity constraints in delay management. Public Transport 1(2):135–154

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Christian-Albrechts-Platz 4, Kiel, Deutschland

    Lasse Kliemann & Anand Srivastav

Authors
  1. Lasse Kliemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anand Srivastav
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lasse Kliemann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kliemann, L., Srivastav, A. Deutsch-indische Kooperation im Algorithm Engineering. Informatik Spektrum 36, 180–186 (2013). https://doi.org/10.1007/s00287-013-0680-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-013-0680-5

Search

Navigation