Andreas Baltz

	2009
18		Andreas Baltz, Anand Srivastav: Multicast Routing and Design of Sparse Connectors. Algorithmics of Large and Complex Networks 2009: 247-265
	2007
17		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav: On the minimum load coloring problem. J. Discrete Algorithms 5(3): 533-545 (2007)
16		Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth: Probabilistic analysis for a multiple depot vehicle routing problem. Random Struct. Algorithms 30(1-2): 206-225 (2007)
	2006
15		Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav: The Price of Anarchy in Selfish Multicast Routing. CAAN 2006: 5-18
	2005
14		Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. FSTTCS 2005: 360-371
13		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav: On the Minimum Load Coloring Problem. WAOA 2005: 15-26
12		Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen: The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. Electr. J. Comb. 12: (2005)
11		Andreas Baltz, Gerold Jäger, Anand Srivastav: Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45(3): 119-124 (2005)
10		Andreas Baltz, Anand Srivastav: Approximation algorithms for the Euclidean bipartite TSP. Oper. Res. Lett. 33(4): 403-410 (2005)
	2004
9		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav: Coloring Graphs with Minimal Edge Load. CTW 2004: 16-20
8		Andreas Baltz, Lasse Kliemann: Spectral Analysis. Network Analysis 2004: 373-416
7		Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav: Coloring Graphs with Minimal Edge Load. Electronic Notes in Discrete Mathematics 17: 9-13 (2004)
6		Andreas Baltz, Anand Srivastav: Fast approximation of minimum multicast congestion - Implementation VERSUS Theory. RAIRO - Operations Research 38(4): 319-344 (2004)
	2003
5		Andreas Baltz, Anand Srivastav: Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. CIAC 2003: 165-177
4		Andreas Baltz, Gerold Jäger, Anand Srivastav: Constructions of Sparse Asymmetric Connectors: Extended Abstract. FSTTCS 2003: 13-22
	2001
3		Andreas Baltz, Tomasz Schoen, Anand Srivastav: On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. RANDOM-APPROX 2001: 192-201
2		Andreas Baltz, Tomasz Schoen, Anand Srivastav: Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). Electronic Notes in Discrete Mathematics 7: 42-45 (2001)
	1999
1		Andreas Baltz, Tomasz Schoen, Anand Srivastav: Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. RANDOM-APPROX 1999: 138-143

Coauthor Index

1	Nitin Ahuja	[7] [9] [13] [17]
2	Benjamin Doerr	[7] [9] [13] [17]
3	Devdatt P. Dubhashi	[14] [16]
4	Sandro Esquivel	[15]
5	Peter Hegarty	[12]
6	Gerold Jäger	[4] [11]
7	Lasse Kliemann	[8] [15]
8	Jonas Knape	[12]
9	Urban Larsson	[12]
10	Ales Prívetivý	[13] [17]
11	Tomasz Schoen	[1] [2] [3] [12]
12	Anand Srivastav	[1] [2] [3] [4] [5] [6] [7] [9] [10] [11] [13] [14] [15] [16] [17] [18]
13	Libertad Tansini	[14] [16]
14	Sören Werth	[14] [16]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page