Anand Srivastav

Learn More
Proofs of classical Chernoff-Hoeffding bounds has been used to obtain polynomial-time implementations of Spencer's derandomization method of conditional probabilities on usual finite machine models: given m events whose complements are large deviations corresponding to weighted sums of n mutually independent Bernoulli trials, Raghavan's lattice(More)
Artocarpin, a tetrameric lectin of molecular mass 65 kDa, is one of the two lectins extracted from the seeds of jackfruit. The structures of the complexes of artocarpin with mannotriose and mannopentose reported here, together with the structures of artocarpin and its complex with Me-alpha-mannose reported earlier, show that the lectin possesses a(More)
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT+ exp(1)(More)
For numerical integration in higher dimensions, bounds for the star-discrepancy with polynomial dependence on the dimension d are desirable. Furthermore, it is still a great challenge to give construction methods for lowdiscrepancy point sets. In this paper we give upper bounds for the star-discrepancy and its inverse for subsets of the d-dimensional unit(More)
We determine the combinatorial discrepancy of the hypergraph H of cartesian products of d arithmetic progressions in the [N ]d–lattice ([N ] = {0, 1, . . . ,N − 1}). The study of such higher dimensional arithmetic progressions is motivated by a multi-dimensional version of van der Waerden’s theorem, namely the Gallai-theorem (1933). We solve the discrepancy(More)
In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k-UNCUT, MAX-k-DIRECTEDCUT, MAX-k-DIRECTED-UNCUT, MAX-k-DENSE-SUBGRAPH, and MAX-k-VERTEX-COVER. It was observed by Han, Ye, Zhang (2002) and Halperin, Zwick (2002) that a parameter-driven random(More)
We consider the following resource constrained scheduling problem. Given m identical processors, s resources with upper bounds, n independent tasks of unit length, where each task has a start time and requires one processor and a task-dependent amount of every resource. The optimization problem is to schedule all tasks at discrete times in II N, minimizing(More)