Andreas Baltz

According to our database, Andreas Baltz authored at least 15 papers between 1999 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.

Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav

J. Oper. Res. Soc., 2015

2009

Multicast Routing and Design of Sparse Connectors.

Andreas Baltz, Anand Srivastav

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2007

Probabilistic analysis for a multiple depot vehicle routing problem.

Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth

Random Struct. Algorithms, 2007

On the minimum load coloring problem.

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav

J. Discrete Algorithms, 2007

2006

The Price of Anarchy in Selfish Multicast Routing.

Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

Approximation algorithms for the Euclidean bipartite TSP.

Andreas Baltz, Anand Srivastav

Oper. Res. Lett., 2005

Constructions of sparse asymmetric connectors with number theoretic methods.

Andreas Baltz, Gerold Jäger, Anand Srivastav

Networks, 2005

The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc.

Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen

Electron. J. Comb., 2005

2004

Fast approximation of minimum multicast congestion - Implementation VERSUS Theory.

Andreas Baltz, Anand Srivastav

RAIRO Oper. Res., 2004

Coloring Graphs with Minimal Edge Load.

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav

Electron. Notes Discret. Math., 2004

Spectral Analysis.

Andreas Baltz, Lasse Kliemann

Proceedings of the Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 2004

2003

Constructions of Sparse Asymmetric Connectors: Extended Abstract.

Andreas Baltz, Gerold Jäger, Anand Srivastav

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2001

Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).

Andreas Baltz, Tomasz Schoen, Anand Srivastav

Electron. Notes Discret. Math., 2001

On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.

Andreas Baltz, Tomasz Schoen, Anand Srivastav

Proceedings of the Approximation, 2001

1999

Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.

Andreas Baltz, Tomasz Schoen, Anand Srivastav

Proceedings of the Randomization, 1999