Andreas Baltz

19 papers B 1C 2Journal 9Unranked 7
YearRankTypeTitle / Venue / Authors
2015 J jnl
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.
J. Oper. Res. Soc.
Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav
2009 — conf
Multicast Routing and Design of Sparse Connectors.
Algorithmics of Large and Complex Networks
Andreas Baltz, Anand Srivastav
2007 J jnl
On the minimum load coloring problem.
J. Discrete Algorithms
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
2007 J jnl
Probabilistic analysis for a multiple depot vehicle routing problem.
Random Struct. Algorithms
Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth
2006 — conf
The Price of Anarchy in Selfish Multicast Routing.
CAAN
Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
2005 J jnl
Approximation algorithms for the Euclidean bipartite TSP.
Oper. Res. Lett.
Andreas Baltz, Anand Srivastav
2005 J jnl
Constructions of sparse asymmetric connectors with number theoretic methods.
Networks
Andreas Baltz, Gerold Jäger, Anand Srivastav
2005 B conf
On the Minimum Load Coloring Problem.
WAOA
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
2005 — conf
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem.
FSTTCS
Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth
2005 J jnl
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc.
Electron. J. Comb.
Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen
2004 C conf
Coloring Graphs with Minimal Edge Load.
CTW
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
2004 J jnl
Coloring Graphs with Minimal Edge Load.
Electron. Notes Discret. Math.
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
2004 J jnl
Fast approximation of minimum multicast congestion - Implementation VERSUS Theory.
RAIRO Oper. Res.
Andreas Baltz, Anand Srivastav
2004 — conf
Spectral Analysis.
Network Analysis
Andreas Baltz, Lasse Kliemann
2003 — conf
Constructions of Sparse Asymmetric Connectors: Extended Abstract.
FSTTCS
Andreas Baltz, Gerold Jäger, Anand Srivastav
2003 C conf
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory.
CIAC
Andreas Baltz, Anand Srivastav
2001 — conf
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.
RANDOM-APPROX
Andreas Baltz, Tomasz Schoen, Anand Srivastav
2001 J jnl
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).
Electron. Notes Discret. Math.
Andreas Baltz, Tomasz Schoen, Anand Srivastav
1999 — conf
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.
RANDOM-APPROX
Andreas Baltz, Tomasz Schoen, Anand Srivastav