Research Group Discrete Optimization

Publications before 2007

2006

Anand Srivastav: The Lovász-Local-Lemma and Scheduling. Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications, Lecture Notes of Computer Science 3484: 321-347 (2006). DOI:10.1007/11671541_11

Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav. The Price of Anarchy in Selfish Multicast Routing. 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, Chester, UK, June 2006 (CAAN 2006). Springer Lecture Notes in Computer Science 4235: 5-18 (2006). DOI:10.1007/11922377_2

2005

Gerold Jäger, Anand Srivastav: Improved Approximation Algorithms for Maximum Graph Partitioning Problems. Journal of Combinatorial Optimization 10(2): 133-167 (2005). DOI:10.1007/978-3-540-30538-5_29

Andreas Baltz, Gerold Jäger, Anand Srivastav: Constructions of sparse asymmetric connectors with number theoretic methods. Networks 45(3): 119-124 (2005). DOI:10.1002/net.20058

Andreas Baltz, Devdatt P. Dubhashi, Libertad Tansini, Anand Srivastav, Sören Werth: Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, December 2005 (FSTTCS 2005), pages 360-371

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales Privetivy, Anand Srivastav: On the Minimum Load Coloring Problem. Proceedings of the 3rd Workshop on Approximation and Online Algorithms, Palma de Mallorca, Spain, October 2005 (WAOA 2005). Springer Lecture Notes in Computer Science 3879: 15–26 (2005)

Benjamin Doerr, Michael Gnewuch, Anand Srivastav: Bounds and constructions for the star-discrepancy via delta-covers. Journal of Complexity 21(5): 691–709 (2005). DOI:10.1016/j.jco.2005.05.002

Andreas Baltz, Anand Srivastav: Approximation algorithms for the Euclidean bipartite TSP. Operations Research Letters 33(4): 403–410 (2005). DOI:10.1016/j.orl.2004.08.002

2004

Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav: Coloring Graphs with Minimal Edge Load. Electronic Notes in Discrete Mathematics 17: 9-13 (2004). DOI:10.1016/j.endm.2004.03.005

Andreas Baltz, Anand Srivastav: Fast Approximation of minimum multicast congestion - Implementation vs. Theory.  RAIRO Operations Research 38(4): 319–344 (2004). DOI:10.1051/ro:2004028

Benjamin Doerr, Anand Srivastav, Petra Wehr: Discrepancy of cartesian products of arithmetic progressions. Electronic Journal of Combinatorics 11(1): 1-16 (2004)

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav: Ordered binary decision diagrams and the Shannon effect. Discrete Applied Mathemetics 142(1-3): 67–85 (2004). DOI:10.1016/j.dam.2003.02.003

Gerold Jäger, Anand Srivastav: Improved Approximation Algorithms for Maximum Graph Partitioning Problems. Proceedings of the 24th International Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, December 2004 (FSTTCS 2004). Notes in Computer Science 3328: 348-359 (2004). DOI:10.1007/b104325

2003

Benjamin Doerr, Anand Srivastav: Multicolour Discrepancies. Combinatorics, Probability and Computing 12(4): 365-399 (2003). DOI:10.1017/S0963548303005662

Andreas Baltz, Gerold Jäger, Anand Srivastav: Elementary constructions of sparse asymmetric connectors.  Proceedings of 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, Mumbai, India, December 2003 (FSTTCS 2003). Lecture Notes in Computer Science 2914: 13–22 (2003). DOI:10.1007/978-3-540-24597-1_2

Andreas Baltz, Anand Srivastav: Fast Approximation of minimum multicast congestion – Implementation vs. Theory. Proceedings of the 5th Italian Conference on Algorithms and Complexity, Rome, Italy, May 2003 (CIAC 2003). Lecture Notes in Computer Science 2653:165–177 (2003)

2002

Nitin Ahuja, Anand Srivastav: On Constrained Hypergraph Coloring and Scheduling. Proceedings of the 5th International Workshop on Approximation Algorithms and Combinatorial Optimization, Rome, Italy, September 2002 (APPROX 2002). Lecture Notes in Computer Science 2462: 14–25 (2002). DOI:10.1007/3-540-45753-4_4

Anand Srivastav, Hartmut Schroeter, Christoph Michel: Approximation Algorithms for Pick-and-Place Robots. Annals of Operations Research 107(1-4): 321-338 (2002). DOI:10.1023/A:1014923704338

2001

Andreas Baltz, Tomasz Schoen, Anand Srivastav: Probabilistic Analysis of Bipartite Traveling Salesman Problems. Electronic Notes in Discrete Mathematics 7: 42-45 (2001). DOI:10.1016/S1571-0653(04)00220-3

Andreas Baltz, Tomasz Schoen, Anand Srivastav: On the b-partite directed random travelling salesman problem and its assignment relaxation. Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, USA, August 2001 (APPROX RANDOM 2001). Springer Lecture Notes in Computer Science 2129:192–201 (2001). DOI:10.1007/3-540-44666-4_22

Benjamin Doerr, Anand Srivastav: Recursive randomized coloring beats fair dice coloring. Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 2001 (STACS 2001). Springer Lecture Notes in Computer Science 2010: 183–194 (2001). DOI:10.1007/3-540-44693-1_16

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav: On the evolution of the worst-case OBDD size. Information Processing Letters 77: 1–7 (2001). DOI:10.1016/S0020-0190(00)00148-4

Anand Srivastav: Derandomization in combinatorial optimization. Handbook of Randomized Computing, Volume II. Ed. by Sanguthevar Rajasekaran, Panos M. Pardalos, John H. Reif and José D.P. Rolim. Dordrecht, Netherlands: Academic Publisher: 731-842 (2001)

 2000

Anand Srivastav, Peter Stangier: On Complexity, Representation and Approximation of Integral Multicommodity Flows. Discrete Applied Mathematics 99(1-3): 183-208 (2000)

Andreas Baltz, Anand Srivastav, Tomasz Schoen: Probabilistic construction of small sum-free sets via large Sidon sets Colloquium Math. 2: 171-176 (2000)

1999

Anand Srivastav, Hartmut Schroeter, Christoph Michel: Alternating TSP and Printed Circuit Board Assembly. Electronic Notes in Discrete Mathematics 3: 179-183 (1999). DOI:10.1016/S1571-0653(05)80051-4

Andreas Baltz, Anand Srivastav, Tomasz Schoen: Probabilistic construction of small sum-free sets via large Sidon sets. Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, USA, August 1999 ( RANDOM 1999). Springer Lecture Notes in Computer Science 1671: 138–143 (1999). DOI:10.1007/978-3-540-48413-4_15

Benjamin Doerr, Anand Srivastav: Approximation of multicolor discrepancy. Proceedings of the 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Berkeley, CA, USA, August 1999 (APPROX 1999). Springer Lecture Notes in Computer Science 1671: 39–50 (1999). DOI:10.1007/978-3-540-48413-4_5

1998

Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav: Size and structure of random OBDDs. Proceedings of the 15th Annual Symposium on Aspects of Theoretical Computer Science, Paris, France, February 1998 (STACS 1998). Springer Lecture Notes in Computer Science 1373: 238–248 (1998). DOI:10.1007/BFb0028565

Harry Preuß, Anand Srivastav: Blockwise variable orderings for shared BDDs. Proceedings of the 23rd International Symposium on Mathematical Foundation of Computer Science, Brno, Czech Republic, August 1998 (MFCS 1998). Springer Lecture Notes in Computer Science 1450: 636–644 (1998). DOI:10.1007/BFb0055814

Anand Srivastav, Katja Wolf: Finding densest subgraphs with semidefinite programming.  Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Aalborg, Denmark, July 1998 (APPROX 1998). Springer Lecture Notes in Computer Science 1444: 181–193 (1998). DOI:10.1007/BFb0053974

1997

Anand Srivastav, Peter Stangier: A parallel approximation algorithm for resource constrained scheduling and bin packing. Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel, Paderborn, Germany, June 1997 (IRREGULAR 1997). Springer Lecture Notes in Computer Science 1253: 147–159 (1997). DOI:10.1007/3-540-63138-0_14

Anand Srivastav, Peter Stangier: Tight approximation for resource constrained scheduling and bin packing. Discrete Applied Mathematics 79(1-3): 223-245 (1997). DOI:10.1016/S0166-218X(97)00045-0

1996

Anand Srivastav, Peter Stangier: Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures and Algorithms 8(1):27–58 (1996). DOI:10.1002/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T

1995

Anand Srivastav, Peter Stangier: Weighted Fractional and Integral K-matching in Hypergraphs. Discrete Applied Mathematics 57(2-3): 255-269 (1995). DOI:10.1016/0166-218X(94)00107-O

1994

Anand Srivastav, Peter Stangier: Tight Approximations for Resource Constrained Scheduling Problems. European Symposium on Algorithms 1994: 307-318

Anand Srivastav, Peter Stangier: Algorthmic Chernoff-Hoeffding Inequalitiers in Integer Programming. International Symposium on Algorithms and Computation1994: 226-233

1993

Anand Srivastav, Peter Stangier: Integer multicommodity flows with reduced demands. Proceedings of the 1st Annual European Symposium on Algorithms, Bonn/Bad Honnef, Germany, September-October 1993 (ESA 1993). Springer Lecture Notes in Computer Science 726: 360–372 (1993). DOI:10.1007/3-540-57273-2_71

Anand Srivastav, Peter Stangier: On quadratic lattice approximations. Proceedings of the 4th International Symposium on Algorithms and Computation, Hong-Kong, December 1993 (ISAAC 1993). Springer Lecture Notes in Computer Science 762: 176–184 (1993). DOI:10.1007/3-540-57568-5_247

1992

Anand Srivastav: Extreme points of positive functionals and spectral states on real Banach algebras. Canadian Journal of Mathematics 44(4): 856–866 (1992). DOI:10.4153/CJM-1992-051-9

1991

Anand Srivastav: Quaternation-valued representation and commutativity criteria for real Banach algebras. Festschrift zum 60. Geburtstag von Professor Dr. George Maltese, Mathematisches Institut, Westfälische Wilhelms Universität Münster, 8 pages (1991)

Anand Srivastav: A generalization of the Gleason-Kahane-Zelazko theorem for real Banach algebras. Indian Journal of Mathematics 32:217–221 (1991)

1990

Anand Srivastav: Commutativity criteria for real Banach algebras. Archiv der Mathematik 54:65–72 (1990). DOI:10.1007/BF01190670

1989

Alexander Bach, Anand Srivastav: A characterization for the classical states of the quantum harmonic oscillator by means of de Finetti's theorem. Communications in Mathematical Physics 123(3): 453–462 (1989). DOI:10.1007/BF01238810

Anand Srivastav: Absolute continuity and Radon-Nikodym type theorems for weights and traces on von Neumann algebras. Rendiconti del Circolo Matematico di Palermo Series 2 37:257–270 (1989). DOI:10.1007/BF02843998