Deutsch-indische Kooperation im Algorithm Engineering

ZusammenfassungAls 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.

[1]  Viswanath Nagarajan,et al.  Exact train pathing , 2008, J. Sched..

[2]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[3]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[4]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[5]  Anita Schöbel,et al.  Capacity constraints in delay management , 2009, Public Transp..

[6]  Nikhil Bansal,et al.  Constructive Algorithms for Discrepancy Minimization , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[7]  Lasse Kliemann,et al.  Matching in Bipartite Graph Streams in a Small Number of Passes , 2011, SEA.

[8]  Chellapilla Patvardhan,et al.  Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem , 2012, Int. J. Math. Oper. Res..

[9]  Jiří Matoušek,et al.  Discrepancy in arithmetic progressions , 1996 .

[10]  Sumit Ganguly,et al.  Simpler algorithm for estimating frequency moments of data streams , 2006, SODA '06.

[11]  Sebastian Stiller,et al.  Computing delay resistant railway timetables , 2010, Comput. Oper. Res..

[12]  Anita Schöbel,et al.  A Scenario-Based Approach for Robust Linear Optimization , 2011, TAPAS.

[13]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[14]  Anand Srivastav,et al.  Bipartite Matching in the Semi-streaming Model , 2012, Algorithmica.

[15]  Sophie Boyd.  Public transport-1 , 2013 .

[16]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[17]  Benjamin Doerr,et al.  Ants easily solve stochastic shortest path problems , 2012, GECCO '12.

[18]  V. N. Muralidhara,et al.  The Covert Set-Cover Problem with Application to Network Discovery , 2010, WALCOM.

[19]  Chellapilla Patvardhan,et al.  A hybrid quantum evolutionary algorithm for solving engineering optimization problems , 2010, Int. J. Hybrid Intell. Syst..

[20]  K. F. Roth.  Remark concerning integer sequences , 1964 .