| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sebastian Eggert, Lasse Kliemann, Peter Munstermann, Anand Srivastav |
Bipartite Matching in the Semi-streaming Model.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nils Hebbinghaus, Anand Srivastav |
Discrepancy of Centered Arithmetic Progressions in Zp (Extended Abstract). |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mourad El Ouali, Antje Fretwurst, Anand Srivastav |
Inapproximability of b-Matching in k-Uniform Hypergraphs. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gnewuch, Anand Srivastav, Carola Winzen |
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. |
J. Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Eggert, Lasse Kliemann, Anand Srivastav |
Bipartite Graph Matchings in the Semi-streaming Model. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
approx, algorithms, streaming algorithms, bipartite graph matching |
| 1 | Lasse Kliemann, Anand Srivastav |
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. |
SEA |
2009 |
DBLP DOI BibTeX RDF |
hypergraph matching, approximation algorithms, greedy algorithms, hybrid algorithms, NP-hard problems, randomized rounding |
| 1 | Lasse Kliemann, Anand Srivastav |
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing. |
Algorithmics of Large and Complex Networks |
2009 |
DBLP DOI BibTeX RDF |
non-atomic congestion games, Wardrop model, unicast routing, multicast routing, price of anarchy |
| 1 | Andreas Baltz, Anand Srivastav |
Multicast Routing and Design of Sparse Connectors. |
Algorithmics of Large and Complex Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav |
Cubature formulas for function spaces with moderate smoothness. |
J. Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Devdatt P. Dubhashi, Anand Srivastav, Libertad Tansini, Sören Werth |
Probabilistic analysis for a multiple depot vehicle routing problem. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav |
On the minimum load coloring problem. |
J. Discrete Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerold Jäger, Anand Srivastav, Katja Wolf |
Solving Generalized Maximum Dispersion with Linear Programming. |
AAIM |
2007 |
DBLP DOI BibTeX RDF |
Generalized Maximum Dispersion, Approximation Algorithms, Randomized Algorithms |
| 1 | Anand Srivastav, Sören Werth |
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav |
The Price of Anarchy in Selfish Multicast Routing. |
CAAN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Anand Srivastav |
Approximation algorithms for the Euclidean bipartite TSP. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerold Jäger, Anand Srivastav |
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
maximum graph partitioning, semidefinite programming, approximation factor |
| 1 | Benjamin Doerr, Michael Gnewuch, Anand Srivastav |
Bounds and constructions for the star-discrepancy via ?-covers. |
J. Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Gerold Jäger, Anand Srivastav |
Constructions of sparse asymmetric connectors with number theoretic methods. |
Networks |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Prívetivý, Anand Srivastav |
On the Minimum Load Coloring Problem. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth |
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav |
Coloring Graphs with Minimal Edge Load. |
Electronic Notes in Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Anand Srivastav |
Fast approximation of minimum multicast congestion - Implementation VERSUS Theory. |
RAIRO - Operations Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anand Srivastav, Petra Wehr |
Discrepancy of Cartesian Products of Arithmetic Progressions. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav |
Ordered binary decision diagrams and the Shannon effect. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav |
Coloring Graphs with Minimal Edge Load. |
CTW |
2004 |
DBLP BibTeX RDF |
|
| 1 | Gerold Jäger, Anand Srivastav |
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anand Srivastav |
Multicolour Discrepancies. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Gerold Jäger, Anand Srivastav |
Constructions of Sparse Asymmetric Connectors: Extended Abstract. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Anand Srivastav |
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Integer programming, Multicast routing |
| 1 | Nitin Ahuja, Anand Srivastav |
On Constrained Hypergraph Coloring and Scheduling. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anand Srivastav |
Multicolor Discrepancy of Arithmetic Progressions - Extended Abstract. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Tomasz Schoen, Anand Srivastav |
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract). |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anand Srivastav |
Multi-Color Discrepancies - Extended Abstract -. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav |
On the evolution of the worst-case OBDD size. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Hartmut Schroeter, Christoph Michel |
Approximation Algorithms for Pick-and-Place Robots. |
Annals OR |
2001 |
DBLP DOI BibTeX RDF |
pick-and-place robots, printed circuit board assembly problem, bipartite travelling salesman problem, approximation algorithms, combinatorial optimization, matching |
| 1 | Benjamin Doerr, Anand Srivastav |
Recursive Randomized Coloring Beats Fair Dice Random Colorings. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Tomasz Schoen, Anand Srivastav |
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
Asymmetric b-partite TSP, Assignment Problem |
| 1 | Anand Srivastav, Peter Stangier |
On Complexity, Representation and Approximation of Integral Multicommodity Flows. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Hartmut Schroeter, Christoph Michel |
Alternating TSP and Printed Circuit Board Assembly. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Anand Srivastav |
Approximation of Multi-color Discrepancy. |
RANDOM-APPROX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Tomasz Schoen, Anand Srivastav |
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets. |
RANDOM-APPROX |
1999 |
DBLP BibTeX RDF |
|
| 1 | Harry Preuß, Anand Srivastav |
Blockwise Variable Orderings for Shared BDDs. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav |
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Katja Wolf |
Finding Dense Subgraphs with Semidefinite Programming. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming |
| 1 | Anand Srivastav, Peter Stangier |
Tight Approximations for Resource Constrained Scheduling and Bin Packing. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
A Parallel Approximation Algorithm for Resource Constrained Scheduling and Bin Packing. |
IRREGULAR |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
Algorithmic Chernoff-Hoeffding inequalities in integer programming. |
Random Struct. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
Weighted Fractional and Integral K-matching in Hypergraphs. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
Tight Approximations for Resource Constrained Scheduling Problems. |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
Integer Multicommodity Flows with Reduced Demands. |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Srivastav, Peter Stangier |
On Quadratic Lattice Approximations. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")