2 papers
cs.DS2017
Balanced Facilities on Random Graphs
Roee David, Nimrod Talmon
Given a graph G with n vertices and k players, each of which is placing a facility on one of the vertices of G, we define the score of the i'th player to be the number of vertices…
cs.CC2016
On the effect of randomness on planted 3-coloring models
Roee David, Uriel Feige
We present the hosted coloring framework for studying algorithmic and hardness results for the -coloring problem. There is a class of host graphs. One selects a graph…