Securely Solving the Distributed Graph Coloring Problem


Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion. A typical approach for solving such problem is to collect all of this information together and centrally solve… (More)


9 Figures and Tables

Slides referencing similar topics