Search the dblp DataBase

Publications of Author

1. Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
   The Price of Anarchy in Selfish Multicast Routing. [Citation Graph (0, 0)][DBLP]
   CAAN, 2006, pp:5-18 [Conf]
   
2. Andreas Baltz, Anand Srivastav
   Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. [Citation Graph (0, 0)][DBLP]
   CIAC, 2003, pp:165-177 [Conf]
   
3. Andreas Baltz, Lasse Kliemann
   Spectral Analysis. [Citation Graph (0, 0)][DBLP]
   Network Analysis, 2004, pp:373-416 [Conf]
   
4. Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth
   Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2005, pp:360-371 [Conf]
   
5. Andreas Baltz, Gerold Jäger, Anand Srivastav
   Constructions of Sparse Asymmetric Connectors: Extended Abstract. [Citation Graph (0, 0)][DBLP]
   FSTTCS, 2003, pp:13-22 [Conf]
   
6. Andreas Baltz, Tomasz Schoen, Anand Srivastav
   On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 2001, pp:192-201 [Conf]
   
7. Andreas Baltz, Tomasz Schoen, Anand Srivastav
   Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. [Citation Graph (0, 0)][DBLP]
   RANDOM-APPROX, 1999, pp:138-143 [Conf]
   
8. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
   On the Minimum Load Coloring Problem. [Citation Graph (0, 0)][DBLP]
   WAOA, 2005, pp:15-26 [Conf]
   
9. Andreas Baltz, Gerold Jäger, Anand Srivastav
   Constructions of sparse asymmetric connectors with number theoretic methods. [Citation Graph (0, 0)][DBLP]
   Networks, 2005, v:45, n:3, pp:119-124 [Journal]
   
10. Andreas Baltz, Anand Srivastav
    Approximation algorithms for the Euclidean bipartite TSP. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:403-410 [Journal]
    
11. 
    Multicast Routing and Design of Sparse Connectors. [Citation Graph (, )][DBLP]
    
    
12. 
    The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. [Citation Graph (, )][DBLP]