Hi, I was looking at two-way constraint matching problem. These are typically used in matchmaking applications where match is made between two users whose profiles mutually satisfy each other's constraints. Can anyone please tell me under which general class of problem these fall into? Basically I am interested to explore more into the various techniques and research done on this problem. Thanks, Ravi
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
