Research Group Discrete Optimization

Publications since 2007

Books

Submitted

Peer-Revied Articles in Journals, Conference Proceedings and Books

Books

William W. L. Chen, Anand Srivastav, Gioncarlo Travaglini, A Panorama of Discrepancy Theory, Springer-Verlag, 681 pages, 2014.

Submitted

Christian Glazik, Jan Schiemann, Anand Srivastav: Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM. (Submitted on 11 Oct 2017); arXiv:1710.04091v1

Volkmar Sauerland, Ulrike Löptien, Claudine Leonhard, Andreas Oschlies, and Anand Srivastav, Error assessment of biogeochemical models by lower bound methods. (2017), Geoscientific Model Development Discussions. doi: 10.5194/gmd-2017-133

Lasse Kliemann, Jan Schiemann, Anand Srivastav: Finding Euler Tours in the StrSort Model. CoRR abs/1610.03412 (2016)

Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav: On the Query Complexity of Black-Peg AB-Mastermind. CoRR abs/1611.05907 (2016)

Peer-Revied Articles in Journals, Conference Proceedings and Books

2018

Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav: On the Query Complexity of Black-Peg AB-Mastermind. CoRR abs/1611.05907 (2016). Submitted to Electronic Journal of Combinatorics. Games, 2018, vol. 9, issue 1, 1-12

2017

Christian Glazik, Gerold Jäger, Jan Schiemann and Anand Srivastav: Bounds for Static Black-Peg AB Mastermind.In: Proceedings of 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2017), Springer Berlin/Heidelberg, 2017

Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten Reusch, Philip Rosenstiel. An Improved Filtering Algorithm for Big Read Datasets. BMC Bioinformatics (2017); 18: 324.DOI:  10.1186/s12859-017-1724-7

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav: Swap Equilibria under Link and Vertex Destruction. Games 8(1), 14; doi:10.3390/g8010014 (registering DOI) .

Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav: Price of anarchy for graph coloring games with concave payoff. Journal of Dynamics and Games (JDG) 4(1):41-58 (2017). DOI:10.3934/jdg.2017003

Iris Kriest, Volkmar Sauerland, Samar Khatiwala, Anand Srivastav and Andreas

Oschlies: Calibrating a global three-dimensional biogeochemical ocean model (MOPS-1.0). Geoscientific Model Development 10(1): 127-154 (2017). DOI:10.5194/gmd-10-127-2017

2016

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

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 (2016). DOI:10.1007/s10878-014-9793-2

C. Patvardhan, Sulabh Bansal, Anand Srivastav: Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. Swarm and Evolutionary Computation 26: 175-190 (2016). DOI:10.1016/j.swevo.2015.09.005

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

2015

Andreas Baltz, Mourad El Ouali, Gerold Jäger: Volkmar Sauerland, Anand Srivastav. Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection. Journal of the Operational Research Society 66(4): 615-626 (2015). DOI:10.1057/jors.2014.17

C Patvardhan, Sulabh Bansal, Anand Srivastav: Quantum-Inspired Evolutionary Algorithm for Difficult Knapsack Problems. Memetic Computing 7(2):135-155 (2015). DOI:10.1007/s12293-015-0162-1

C Patvardhan, Sulabh Bansal, Anand Srivastav: Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. Journal of Computational and Applied Mathematics 285:86-99 (2015). DOI:10.1016/j.cam.2015.02.016

C Patvardhan, Sulabh Bansal, Anand Srivastav: Towards right amount of randomness in Quantum-inspired Evolutionary Algorithms. Soft Computing 2015:1-20 (2015). DOI:10.1007/s00500-015-1880-5

C Patvardhan, Prem Prakash, Anand Srivastav: Fast Heuristics for large instances of the Euclidean Bounded Diameter Minimum Spanning tree problem. Informatica 39:281-292 (2015)

2014

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

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

C Patvardhan, Prem Prakash, Anand Srivastav: Parallel Heuristics for the Bounded Diameter Minimum Spanning Tree Problem. Proceedings of the 11th IEEE India Conference (INDICON 2014), Pune, December 2014, 5 pages. DOI:10.1109/INDICON.2014.7030575

C Patvardhan, Sulabh Bansal, Anand Srivastav: Balanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem. International Journal of Intelligent Systems and Applications 11:1-11 (2014). DOI:10.5815/ijisa.2014.11.01

C Patvardhan, Sulabh Bansal, Anand Srivastav: Solution of ‘hard’ knapsack instances using Quantum Inspired Evolutionary Algorithm. International Journal of Applied Evolutionary Computation 5(1):52-68 (2014). DOI:10.4018/ijaec.2014010104

Nils Hebbinghaus, Anand Srivastav: Multicolor discrepancy of arithmetic structures. In: A Panorama of Discrepancy Theory. Ed. by William W. L. Chen, Anand Srivastav, and Giancarlo Travaglini. Volume 2107 of the series Lecture Notes in Mathematics pp 319-424 Springer-Verlag (2014)

2013

Lasse Kliemann, Anand Srivastav: Deutsch-indische Kooperation im Algorithm Engineering. Informatik Spektrum 36(2): 180-186 (2013). DOI:10.1007/s00287-013-0680-5

Mourad El Ouali, Helena Fohlin, Anand Srivastav: A randomised approximation algorithm for the hitting set problem. Proceedings of the 7th International Workshop on Algorithms and Computation, Kharagpur, India, February 2013 (WALCOM 2013). Lecture Notes in Computer Science 7748:101–113 (2013). DOI:10.1007/978-3-642-36065-7_11

Lasse Kliemann, Ole Kliemann, C. Patvardhan, Volkmar Sauerland, Anand Srivastav: A new QEA computing near-optimal low-discrepancy colorings in the hypergraph of arithmetic progressions. Proceedings of the 12th International Symposium on Experimental and Efficient Algorithms, Rome, Italy, June 2013 (SEA 2013). Lecture Notes in Computer Science 7933: 67–78 (2013). DOI:10.1007/978-3-642-38527-8_8

2012

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

Mourad El Ouali, Helena Fohlin, Anand Srivastav: A randomised approximation algorithm for the partial vertex cover problem in hypergraphs. Proceedings of the 1st Mediterranean Conference on Algorithms, Kibbutz Ein Gedi, Isreal, December 2012 (MedAlg 2012). Lecture Notes in Computer Science 7659: 174–187 (2012). DOI:10.1007/978-3-642-34862-4_13

C. Patvardhan, Prem Prakash, Anand Srivastav: Novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. International Journal of Mathematics in Operational Research 4(2):114–127 (2012). DOI:10.1504/IJMOR.2012.046373

2011

Nils Hebbinghaus, Anand Srivastav: Discrepancy of Centered Arithmetic Progressions in Zp. Electronic Notes in Discrete Mathematics 38: 449-456 (2011)

Mourad El Ouali, Antje Fretwurst, Anand Srivastav: Inapproximability of b-Matching in k-uniform Hypergraphs.  Proceedings of the 5th International Workshop on Algorithms and Computation (WALCOM 2011). Springer Lecture Notes in Computer Science 6552: 57–69 (2011). DOI:10.1007/978-3-642-19094-0_8

2010

C. Patvardhan, Johannes Rückelt, Volkmar Sauerland, Thomas Slawig, Anand Srivastav, Ben Ward: Parameter Optimization and Uncertainty Analysis in a Model of Oceanic CO2-Uptake using a Hybrid Algorithm and Algorithmic Differentiation.  Nonlinear Analysis B: Real World Applications 11:3992–4009 (2010). DOI:10.1016/j.nonrwa.2010.03.006

Anna Heinle, Andreas Macke, Anand Srivastav: Automatic cloud classification of the whole sky images. Atmospheric Measurement Techniques 3:269–299 (2010). DOI:10.5194/amt-3-557-2010

2009

Andreas Baltz, Anand Srivastav: Multicast routing and design of sparse connectors. In: Algorithmics of Large and Complex Networks. Ed. by Jürgen Lerner, Dorothea Wagner, Katharina Zweig, Springer Lecture Notes in Computer Science 5515: 247–265 (2009). DOI:10.1007/978-3-642-02094-0_12

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.

Lasse Kliemann, Anand Srivastav: Models of Non-atomic Congestion Games – From Unicast to Multicast Routing. In: Algorithmics of Large and Complex Networks. Ed. by Jürgen Lerner, Dorothea Wagner, Katharina Zweig, Springer Lecture Notes in Computer Science 5515: 292–318 (2009)

C. Patvardhan, Volkmar Sauerland, Anand Srivastav: Systemic studies on large scale natural systems: An efficient quantum evolutionary algorithm for marine CO2-simulation. Proceedings of the International Conference on Applied Systems Research, Dayalbagh Educational Institute, Agra, India (NSC 2009), pages 44-47 (2009)

C. Patvardhan, Prem Prakash, Anand Srivastav:  A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. Proceedings of the International Conference on Operations Research Applications. Engineering And Management, Tiruchirappalli, India, May 2009 (ICOREM 2009), pages 2061-2064 (2009). Best OR Application in Engineering Award, sponsored by the Anna University, Tiruchirappalli. Accepted at the International Journal of Mathematics in Operations Research.

Sebastian Eggert, Lasse Kliemann, Anand Srivastav: Bipartite Graph Matchings in the Semi-Streaming Model.  Proceedings of the 17th European Symposium on Algorithms, Copenhagen, Denmark, September 2009 (ESA 2009). Springer Lecture Notes in Computer Science 5757: 492–503 (2009). DOI:10.1007/978-3-642-04128-0_44

Lasse Kliemann, Anand Srivastav: Experimental Study of Non-Oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching.  Proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, Dortmund, Germany, June 2009 (SEA 2009). Springer Lecture Notes in Computer Science 5526: 185–196 (2009)

Michael Gnewuch, Anand Srivastav, Carola Winzen: Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. Journal of Complexity 25(2): 115–127 (2009). DOI:10.1016/j.jco.2008.10.001

2008

Helena Fohlin, Lasse Kliemann, Anand Srivastav: Randomized Algorithms for Mixed Matching and Covering Problems in Brachytherapy. Optimization in Medicine. Ed. by Carlos J. S. Alves, Panos M. Pardalos, Luis N. Vicente, Springer, 2008. DOI:10.1007/978-0-387-73299-2_4

2007

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, 18-1 to 18-61 (2007)

Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav: Cubature formulas for function spaces with moderate smoothness. Journal of Complexity 23(4-6): 828-850 (2007). DOI:10.1016/j.jco.2007.07.002

Ulrich Heute, Jörg Kliewer, Volkmar Sauerland, Anand Srivastav: Fixed-Point FIR filters and filter banks: improved design by randomized quantizations. Proceedings of the 20th IEEE International Symposium on Signal Processing and its Applications, Sharjah, U.A.E., February 2007 (ISSPA 2007), pages 244-248 (2007)

Gerold Jäger, Anand Srivastav, Katja Wolf: Solving Generalized Maximum Dispersion with Linear Programming. Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management, Portland, OR, USA, June 2007 (AAIM 2007). Springer Lecture Notes in Computer Science 4508: 1-10 (2007). DOI:10.1007/978-3-540-72870-2_1

C. Patvardhan, Apurva Nayaran, Anand Srivastav: Enhanced quantum evolutionary algorithm for difficult knapsack problems. Proceedings of the 2nd International Conference on Pattern Recognition and Machine Intelligence, Premi 2007, Indian Statistical Institute, Kolkata, India. Springer Lecture Notes in Computer Science 4814: 252–260 (2007). DOI:10.1007/978-3-540-77046-6_31

Anand Srivastav, Sören Werth: Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. Proceedings of the 27th International Conference on Software Technology and Theoretical Computer Science, New Delhi, India, December 2007 (FSTTCS 2007). Springer Lecture Notes in Computer Science 4855: 497-507 (2007). DOI:10.1007/978-3-540-77050-3_41

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, Anand Srivastav: On the Minimum Load Coloring Problem. Journal of Discrete Algorithms 5(3):533–545 (2007). DOI:10.1016/j.jda.2006.09.001

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

Frank-Andre Siebert, Anand Srivastav, Lasse Kliemann, Helena Fohlin, György Kovács: Three-dimensional reconstruction of seed implants by randomized rounding and visual evaluation. Medical Physics 34(3): 967-957 (2007). DOI:10.1118/1.2436975

Publications before 2007