MSc Big Data Computing Homeworks at UniPD
Link: G04HW1.java
Contents:
- Solution with Deterministic partitions
- Solution with Spark partitions
Link: G04HW2.java
Contents:
- Exact solution
- 2-approximation by taking k random points and returning the maximum distance between these points and all other points of S
- Exact solution of a subset of C of S, where C are k centers retruned by Farthest-First Traversal
Link:
Contents:
- 2 Round Map Reduce for Diversity Maximization Problem
- Test the program on the cluster CloudVeneto
Stefano Ivancich | Denis Deronjic | Lorenzo Farinea |
---|---|---|
github.com/ivaste |
github.com/deno750 |
github.com/Lollyz |