Srivastav Anand

Anand Srivastav

Information about the author Anand Srivastav will soon be added to the site.
Found 7 papers in total
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection
2015
We introduce and study the Travelling Salesman Problem with Multiple Time Windows and...
Bipartite Matching in the Semi‐streaming Model
Bipartite Matching in the Semi‐streaming Model
2012
We present the first deterministic 1+ ϵ approximation algorithm for finding...
Approximation algorithms for the Euclidean bipartite traveling salesman problem
Approximation algorithms for the Euclidean bipartite traveling salesman problem
2005
We study approximation results for the Euclidean bipartite traveling salesman problem...
Fast approximation of minimum multicast congestion – implementation versus theory
Fast approximation of minimum multicast congestion – implementation versus theory
2004
The problem of minimizing the maximum edge congestion in a multicast communication...
Approximation algorithms for pick-and-place robots
Approximation algorithms for pick-and-place robots
2001
In this paper we study the problem of finding placement tours for pick-and-place...
On complexity, representation and approximation of integral multicommodity flows
On complexity, representation and approximation of integral multicommodity flows
2000
The paper has two parts. In the algorithmic part integer inequality systems of packing...
Weighted fractional and integral k-matching in hypergraphs
Weighted fractional and integral k-matching in hypergraphs
1995
The authors consider the problem of finding polynomial-time approximations of maximal...
Papers per page: