It remains to verify whether one can accomplish the opposite direction as well Assignment problems of differentsized inputs in mapreduce, ACM Transactions on Knowledge Discovery from Data, vol.11, issue.2, pp.181-1835, 2016. ,
Assignment Problems of Different-Sized Inputs in MapReduce, Proceedings of the EDBT/ICDT Conference, pp.28-37, 2015. ,
DOI : 10.1145/2331042.2331053
The probabilistic method, 2016. ,
DOI : 10.1002/0471722154
Detecting high logdensities: an O(n 1/4 ) approximation for densest k -subgraph, ACM Symposium on Theory of Computing (STOC), pp.201-210, 2010. ,
Bin packing approximation algorithms: survey and classification. Handbook of Combinatorial Optimization, pp.455-531, 2013. ,
-Clique Covering Problem, SIAM Journal on Discrete Mathematics, vol.9, issue.3, pp.492-509, 1996. ,
DOI : 10.1137/S089548019325232X
On the degrees of the vertices of a directed graph, Journal of the Franklin Institute, vol.279, issue.4, pp.290-308, 1965. ,
DOI : 10.1016/0016-0032(65)90340-6
Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, vol.7, issue.4, pp.307-316, 1984. ,
DOI : 10.1007/BF02579141
Coverings and packings Contemporary design theory: A collection of surveys, pp.371-399, 1992. ,
Combinatorial optimization, Matroids, trees, stable sets, pp.39-69, 2003. ,
The CRC Handbook of Combinatorial Designs, volume 42 of Discrete Mathematics and Its Applications, chapter, pp.260-265, 2006. ,
An extremal function for contractions of graphs, Mathematical Proceedings of the Cambridge Philosophical Society, vol.38, issue.02, pp.261-265, 1984. ,
DOI : 10.1016/S0195-6698(80)80001-1
Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus numerantium, vol.15, pp.647-659, 1976. ,