Algorithm Repository -- Most Wanted List
Most Wanted List
Below are a list of problems for which we do not feel that we
have identified adequate codes for the algorithm repository,
and thus we would be particularly excited to hear of any programs
you might know about.
In many cases, the algorithms involved are not that difficult to
implement, so this is also in invitation for students and faculty
to select them for class projects and send us the resulting code.
Our most wanted list includes:
-
Knapsack and Integer Partition --
We would like to see an implementation of
the dynamic programming algorithm for the knapsack, with scaling.
Associated with this would be an implementation of the primary bin-packing
algorithms.
-
Thinning or the Medial-Axis Transform --
Codes working on binary images and polygons are both wanted.
I have already received more than one request for such a code.
-
Chinese Postman Tour --
Such an algorithm should not be too complicated to implement, especially
by using matching codes already available on this site.
-
Graph Partition and Maxcut --
A flexible simulated annealing code for both problems would be greatly
appreciated.
-
Feedback arc/vertex sets --
It would be good to get an implementation of the (fairly simple) heuristics
for feedback sets and see how well they do.
-
Minkowski Sum --
I have already received more than one request for such a code.
-
Set Cover --
I'd like to get more codes with heuristics for set cover and packing.
This algorithms repository is part of the ongoing algorithms-related
research conducted here in the Department of Computer Science at the State
University of New York at Stony Brook.
About the Book
Send us Mail
Go to Main Page