Hi,
**
*Forward this to all your Comp. Sci. friends...*
**
*College of Engineering, Guindy* , Anna University, India, established in
1794 is one of the oldest engineering institutions in the world and has
proved the adage Old is Gold right, time and again, not only by
consistently making it to the
Call for Papers
and
Call for Session Proposals
The 2007 World Congress in Computer Science,
Computer Engineering, and Applied Computing
WORLDCOMP'07
(composed of 24 Joint Conferences)
June
This proplem is a 3D bin packing. any additional information or
solutions are welcome..
thank you
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
In graph theoretical terms the problem is to find a minimal (or a
reasonably sized) vertex cover of a graph using complete multipartite
graphs.
bullockbefriending bard wrote:
Any pointers much appreciated - I simply don't have the background or
experience to be able to visualise what this
