1 citations · 3 across the 6 of their papers we have counts for
7 papers
An Optimal Algorithm for 1-D Cutting Stock Problem
Srikrishnan Divakaran
We present an time algorithm to obtain an optimal solution for -dimensional cutting stock problem: the bin packing problem of packing items onto unit capacity…
A Fast Scalable Heuristic for Bin Packing
Srikrishnan Divakaran
In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub…
Fast Approximation Schemes for Bin Packing
Srikrishnan Divakaran
We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size a…
A Fast Heuristic for Exact String Matching
Srikrishnan Divakaran
Given a pattern string of length consisting of distinct characters and a query string of length , where the characters of and are drawn from an alphabet…
Fast Algorithms for Exact String Matching
Srikrishnan Divakaran
Given a pattern string of length and a query string of length , where the characters of and are drawn from an alphabet of size , the {\em exact string mat…
An Optimal Offline Algorithm for List Update
Srikrishnan Divakaran
For the static list update problem, given an ordered list (an ordering of the list = \{ \}), and a sequence of requests for…
A Fast Template Based Heuristic For Global Multiple Sequence Alignment
Srikrishnan Divakaran, Arpit Mithal, Namit Jain
Advances in bio-technology have made available massive amounts of functional, structural and genomic data for many biological sequences. This increased availability of heterogeneou…