El jueves, 18 de julio de 2013 10:34:11 UTC-5, Sumudu escribió: > I'm not totally sure I've correctly understood the problem, but searching for > "bipartite clique partition" gave me the paper > http://web.eecs.umich.edu/~pettie/matching/Feder-Motwani-clique-partitions-graph-compression.pdf > > Hopefully there is something useful there or in the referenced material. > > One point I'm unclear about is if you absolutely require that each > recommendation appear in exactly one group. If relaxing this to "at least > one" is OK then we're talking about coverings instead of partitions. The > paper > http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.89.3810&rep=rep1&type=pdf > provides an overview of this problem and references for possible algorithms > (be warned that I didn't check if this is an up-to-date review of the > subject).
Thanks very much Sumudu, I will check the references. About you doubt, yes ALL the combination from the Input must be present in the response (grouped). Think you're representing the same combinations using a grouped/condensed view. Regards, raul -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/43f861f5-ff5f-47f4-ae62-2a9a265908c9%40googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
