Andreas Baltz

Department of Computer Science Christian-Albrechts-Universität zu Kiel Christian-Albrechts-Platz 4, 24118 Kiel Phone: +49-431-880 2778

Fields of Research:

• Independent Sets in Hypergraphs
• Sidon-Sets
• Sumfree Sets
• The alternating Traveling-Salesman-Problem
• Design of architectures and algorithms for multicast networks

Recent publications:

• Probabilistic Analysis for a Multiple Depot Vehicle routing problem. In: Proceedings of the 25th Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, December 2005, Springer Lecture Notes in Computer Science, Vol. 3821, 360-371 (2005).
  with D. Dubhashi, A. Srivastav, L. Tansini, and S. Werth
• On the Minimum Load Coloring Problem. To appear in: Proceedings of the Third Workshop on Approximation and Online Algorithms, Mallorca, Spain, October 2005, Springer Lecture Notes in Computer Science (2005).
  with N. Ahuja, B. Doerr, A. Privetivy, and A. Srivastav
• Constructions of Sparse Asymmetric Connectors with Number Theoretic Methods. Networks 45(3), 119-124 (2005).
  with G. Jäger and A. Srivastav
• Approximation Algorithms for the Euclidean Bipartite TSP. Operations Research Letters 33(4), 403-410 (2005).
  with A. Srivastav
• The Structure of Maximum Subsets of {1,...,n} with no Solutions to a+b=kc. The Electronic Journal of Combinatorics, Vol.12(1), R19 (2005).
  with P. Hegarty, J. Knape, U. Larsson, and T. Schoen.
• Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. RAIRO Operations Research 38, 319-344 (2004).
  with A. Srivastav
• Coloring Graphs with Minimal Edge Load. In: Electronic Notes in Discrete Mathematics, Vol.17, 9-13 (2004).
  with N. Ahuja, B. Doerr, and A. Srivastav
• Constructions of Sparse Asymmetric Connectors. In: Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, December 2003, Springer Lecture Notes in Computer Science Vol 2914, 13-22 (2003).
  with G. Jäger, and A. Srivastav
• Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory (Extended Abstract). In: Proceedings of the 5th Conference on Algorithms and Complexity (CIAC) (2003).
  with A. Srivastav
• On the b-partite Directed Random Traveling Salesman Problem and its Assignment Relaxation. Preprint (2001).
  with T. Schoen and A. Srivastav.
• Probabilistic Analysis of Bipartite Traveling Salesman Problems. In: Electronic Notes in Discrete Mathematics, Vol.7, Elsevier Science (2001).
  with T. Schoen and A. Srivastav.
• Algorithmic and Probabilistic Aspects of the Bipartite Traveling Salesman Problem. PhD Thesis (2001).
• Probabilistic construction of small strongly sum-free sets via large Sidon sets. In: Colloq. Math. 86, No.2, 171-176 (2000).
  with T. Schoen and A. Srivastav

Biography:

• 1990-1997 Student of mathematics at the Christian-Albrechts-University, Kiel
• 1998-2001 DFG scholarship in Graduate School 357 : efficient algorithms and multiscale methods
• since 2001 research assistant in the DFG research cluster 1126 on algorithmic aspects of large and complex networks

Last modified August 16, 2005

German / Deutsch