Willkommen auf der Website der Arbeitsgruppe Diskrete Optimierung

Leiter der Arbeitsgruppe Diskrete Optimierung:

Prof. Dr. Anand Srivastav

Christian-Albrechts-Platz 4, R. 914 (CAP 4)
Telefon: +49 431 880-7252
Telefax: +49 431 880-1725

10 most important Publications since 2007:

1.) Mourad El Ouali, Peter Munstermann, Anand Srivastav: Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica 74(2): 574-588. DOI:10.1007/s00453-014-9962-9 (2016)

2.) Mourad El Ouali, Helena Fohlin, Anand Srivastav: An approximation algorithm for the partial vertex cover problem in hypergraphs. Journal of Combinatorial Optimization 31(2): 846-864. DOI:10.1007/s10878-014-9793-2 (2016)

3.) Lasse Kliemann, Christian Schielke, Anand Srivastav: A Streaming Algorithm for the Undirected Longest Path Problem. Proceedings of the 24th Annual European Symposium on Algorithms, Aarhus, Denmark, August 2016 (ESA 2016), pages 56:1–56:17 (2016). DOI:10.4230/LIPIcs.ESA.2016.56

4.) Mourad El Ouali, Helena Fohlin, Anand Srivastav: A randomised approximation algorithm for the hitting set problem. Theoretical Computer Science 555: 23-34 (2014). DOI:10.1016/j.tcs.2014.03.029

5.) William Chen, Anand Srivastav, Giancarlo Travaglini: A Panorama of Discrepancy Theory, Springer Book: Nils Hebbinghaus, Anand Srivastav: Multicolor Discrepancy of Arithmetic Structures, Pages 319-424 (2014)

6.) Nils Hebbinghaus, Anand Srivastav:  Discrepancy of Centered Arithmetic Progressions in Zp. European Journal of Combinatorics 35:324-334 (2014)

7.) Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav: Bipartite Matching in the Semi-streaming Model. Algorithmica 63(1-2): 490-508 (2012).     DOI:10.1007/s00453-011-9556-8

8.) Nils Hebbinghaus, Tomasz Schoen, Anand Srivastav: One-Sided Discrepancy of linear hyperplanes in finite vector spaces. In: Analytic Number Theory, Essays in Honour of Klaus Roth. Ed. by William W. L. Chen, William T. Gowers, Heini Halberstam, Wolfgang M. Schmidt, Robert Charles Vaughan, Cambridge University Press, Cambridge 2009, pp. 205-223 (2009).

9.) Lasse Kliemann, Anand Srivastav: Parallel Algorithms via the Probabilistic Method. Parallel Computing: Models, Algorithms, and Applications. Ed. by Sanguthevar Rajasekaran, John H. Reif, Chapman & Hall/CRC, chapter 18, pp.1-61 (2007).

10.) Andreas Baltz, Devdatt Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. Random Structures and Algorithms 30(1-2): 206-225 (2007). DOI:10.1002/rsa.20156.