Anand Srivastav

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 26

Top Topics

Knapsack Problem

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Publications

Christian Glazik, Jan Schiemann, Anand Srivastav
A One Pass Streaming Algorithm for Finding Euler Tours. Theory Comput. Syst. 67 (4) (2023)
Christian Glazik, Anand Srivastav
A new bound for the Maker-Breaker triangle game. Eur. J. Comb. 104 (2022)
Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi, Mourad El Ouali, Anand Srivastav
Hemivariational inequalities on graphs. Comput. Appl. Math. 41 (4) (2022)
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Approximation algorithm for the multicovering problem. J. Comb. Optim. 41 (2) (2021)
Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav
Bounds for the Static Permutation Mastermind game. Discret. Math. 344 (3) (2021)
V. Prem Prakash, C. Patvardhan, Anand Srivastav
A novel Hybrid Multi-objective Evolutionary Algorithm for the bi-Objective Minimum Diameter-Cost Spanning Tree (bi-MDCST) problem. Eng. Appl. Artif. Intell. 87 (2020)
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Approximation of set multi-cover via hypergraph matching. Theor. Comput. Sci. 845 (2020)
Abbass Gorgi, Mourad El Ouali, Anand Srivastav, Mohamed Hachimi
Approximation algorithm for the Multicovering Problem. CoRR (2020)
Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
On the Query Complexity of Black-Peg AB-Mastermind. Games 9 (1) (2018)
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
Swap Equilibria under Link and Vertex Destruction. Games 8 (1) (2017)
Axel Wedemeyer, Lasse Kliemann, Anand Srivastav, Christian Schielke, Thorsten B. Reusch, Philip Rosenstiel
An improved filtering algorithm for big read datasets and its application to single-cell assembly. BMC Bioinform. 18 (1) (2017)
Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav
Bounds for Static Black-Peg AB Mastermind. COCOA (2) (2017)
Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav
Towards the right amount of randomness in quantum-inspired evolutionary algorithms. Soft Comput. 21 (7) (2017)
Christian Glazik, Jan Schiemann, Anand Srivastav
Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM. CoRR (2017)
C. Patvardhan, Sulabh Bansal, Anand Srivastav
Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems. Swarm Evol. Comput. 26 (2016)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
An approximation algorithm for the partial vertex cover problem in hypergraphs. J. Comb. Optim. 31 (2) (2016)
Mourad El Ouali, Peter Munstermann, Anand Srivastav
Randomized Approximation for the Set Multicover Problem in Hypergraphs. Algorithmica 74 (2) (2016)
Lasse Kliemann, Jan Schiemann, Anand Srivastav
Finding Euler Tours in the StrSort Model. CoRR (2016)
Lasse Kliemann, Christian Schielke, Anand Srivastav
A Streaming Algorithm for the Undirected Longest Path Problem. ESA (2016)
Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav
On the Query Complexity of Black-Peg AB-Mastermind. CoRR (2016)
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
Swap Equilibria under Link and Vertex Destruction. CoRR (2016)
Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav
Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems. Memetic Comput. 7 (2) (2015)
Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav
Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm. J. Comput. Appl. Math. 285 (2015)
Lasse Kliemann, Elmira Shirazi Sheykhdarabadi, Anand Srivastav
Price of Anarchy for Graph Coloring Games with Concave Payoff. CoRR (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. J. Oper. Res. Soc. 66 (4) (2015)
C. Patvardhan, V. Prem Prakash, Anand Srivastav
Fast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem. Informatica (Slovenia) 39 (3) (2015)
Nils Hebbinghaus, Anand Srivastav
Zp. Eur. J. Comb. 35 (2014)
C. Patvardhan, Sulabh Bansal, Anand Srivastav
Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm. Int. J. Appl. Evol. Comput. 5 (1) (2014)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. 555 (2014)
Lasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions. SEA (2013)
Lasse Kliemann, Anand Srivastav
Deutsch-indische Kooperation im Algorithm Engineering. Inform. Spektrum 36 (2) (2013)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
A Randomised Approximation Algorithm for the Hitting Set Problem. WALCOM (2013)
Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav
Bipartite Matching in the Semi-streaming Model. Algorithmica 63 (1-2) (2012)
C. Patvardhan, V. Prem Prakash, Anand Srivastav
Novel quantum-inspired evolutionary algorithms for the quadratic knapsack problem. Int. J. Math. Oper. Res. 4 (2) (2012)
Mourad El Ouali, Helena Fohlin, Anand Srivastav
A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. MedAlg (2012)
Nils Hebbinghaus, Anand Srivastav
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). Electron. Notes Discret. Math. 38 (2011)
Mourad El Ouali, Antje Fretwurst, Anand Srivastav
-Uniform Hypergraphs. WALCOM (2011)
Sebastian Eggert, Lasse Kliemann, Anand Srivastav
Bipartite Graph Matchings in the Semi-streaming Model. ESA (2009)
Lasse Kliemann, Anand Srivastav
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. SEA (2009)
Andreas Baltz, Anand Srivastav
Multicast Routing and Design of Sparse Connectors. Algorithmics of Large and Complex Networks (2009)
Lasse Kliemann, Anand Srivastav
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. Algorithmics of Large and Complex Networks (2009)
Michael Gnewuch, Anand Srivastav, Carola Winzen
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. J. Complex. 25 (2) (2009)
Gerold Jäger, Anand Srivastav, Katja Wolf
Solving Generalized Maximum Dispersion with Linear Programming. AAIM (2007)
Anand Srivastav, Sören Werth
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. FSTTCS (2007)
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
On the minimum load coloring problem. J. Discrete Algorithms 5 (3) (2007)
Ulrich Heute, Anand Srivastav, Volkmar Sauerland, Jörg Kliewer
Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations. ISSPA (2007)
C. Patvardhan, Apurva Narayan, Anand Srivastav
Enhanced Quantum Evolutionary Algorithms for Difficult Knapsack Problems. PReMI (2007)
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) (2007)
Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav
Cubature formulas for function spaces with moderate smoothness. J. Complex. 23 (4-6) (2007)
Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
The Price of Anarchy in Selfish Multicast Routing. CAAN (2006)
Benjamin Doerr, Michael Gnewuch, Anand Srivastav
Bounds and constructions for the star-discrepancy via ?-covers. J. Complex. 21 (5) (2005)
Andreas Baltz, Anand Srivastav
Approximation algorithms for the Euclidean bipartite TSP. Oper. Res. Lett. 33 (4) (2005)
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav
On the Minimum Load Coloring Problem. WAOA (2005)
Andreas Baltz, Gerold Jäger, Anand Srivastav
Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45 (3) (2005)
Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. FSTTCS (2005)
Gerold Jäger, Anand Srivastav
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. J. Comb. Optim. 10 (2) (2005)
Benjamin Doerr, Anand Srivastav, Petra Wehr
Discrepancy of Cartesian Products of Arithmetic Progressions. Electron. J. Comb. 11 (1) (2004)
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
Coloring Graphs with Minimal Edge Load. CTW (2004)
Andreas Baltz, Anand Srivastav
Fast approximation of minimum multicast congestion - Implementation VERSUS Theory. RAIRO Oper. Res. 38 (4) (2004)
Gerold Jäger, Anand Srivastav
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. FSTTCS (2004)
Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. 142 (1-3) (2004)
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav
Coloring Graphs with Minimal Edge Load. Electron. Notes Discret. Math. 17 (2004)
Andreas Baltz, Gerold Jäger, Anand Srivastav
Constructions of Sparse Asymmetric Connectors: Extended Abstract. FSTTCS (2003)
Benjamin Doerr, Anand Srivastav
Multicolour Discrepancies. Comb. Probab. Comput. 12 (4) (2003)
Andreas Baltz, Anand Srivastav
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. CIAC (2003)
Nitin Ahuja, Anand Srivastav
On Constrained Hypergraph Coloring and Scheduling. APPROX (2002)
Benjamin Doerr, Anand Srivastav
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. Electron. Notes Discret. Math. 8 (2001)
Benjamin Doerr, Anand Srivastav
Recursive Randomized Coloring Beats Fair Dice Random Colorings. STACS (2001)
Benjamin Doerr, Anand Srivastav
Multi-Color Discrepancies - Extended Abstract -. Electron. Notes Discret. Math. 7 (2001)
Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
On the evolution of the worst-case OBDD size. Inf. Process. Lett. 77 (1) (2001)
Andreas Baltz, Tomasz Schoen, Anand Srivastav
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. RANDOM-APPROX (2001)
Andreas Baltz, Tomasz Schoen, Anand Srivastav
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). Electron. Notes Discret. Math. 7 (2001)
Anand Srivastav, Hartmut Schroeter, Christoph Michel
Approximation Algorithms for Pick-and-Place Robots. Ann. Oper. Res. 107 (1-4) (2001)
Anand Srivastav, Peter Stangier
On Complexity, Representation and Approximation of Integral Multicommodity Flows. Discret. Appl. Math. 99 (1-3) (2000)
Benjamin Doerr, Anand Srivastav
Approximation of Multi-color Discrepancy. RANDOM-APPROX (1999)
Andreas Baltz, Tomasz Schoen, Anand Srivastav
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. RANDOM-APPROX (1999)
Anand Srivastav, Hartmut Schroeter, Christoph Michel
Alternating TSP and Printed Circuit Board Assembly. Electron. Notes Discret. Math. 3 (1999)
Anand Srivastav, Katja Wolf
Finding Dense Subgraphs with Semidefinite Programming. APPROX (1998)
Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). STACS (1998)
Harry Preuß, Anand Srivastav
Blockwise Variable Orderings for Shared BDDs. MFCS (1998)
Anand Srivastav, Peter Stangier
A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. IRREGULAR (1997)
Anand Srivastav, Peter Stangier
Tight Approximations for Resource Constrained Scheduling and Bin Packing. Discret. Appl. Math. 79 (1-3) (1997)
Anand Srivastav, Peter Stangier
Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Struct. Algorithms 8 (1) (1996)
Anand Srivastav, Peter Stangier
Weighted Fractional and Integral K-matching in Hypergraphs. Discret. Appl. Math. 57 (2-3) (1995)
Anand Srivastav, Peter Stangier
Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. ISAAC (1994)
Anand Srivastav, Peter Stangier
Tight Approximations for Resource Constrained Scheduling Problems. ESA (1994)
Anand Srivastav, Peter Stangier
On Quadratic Lattice Approximations. ISAAC (1993)
Anand Srivastav, Peter Stangier
Integer Multicommodity Flows with Reduced Demands. ESA (1993)