Securely Solving the Distributed Graph Coloring Problem

by   Yuan Hong, et al.

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 the problem. However, this requires all parties to completely share their information, which may lead to serious privacy issues. Thus, it is desirable to propose a privacy preserving technique that can securely solve specific combinatorial optimization problems. A further complicating factor is that combinatorial optimization problems are typically NP-hard, requiring approximation algorithms or heuristics to provide a practical solution. In this paper, we focus on a very well-known hard problem -- the distributed graph coloring problem, which has been utilized to model many real world problems in scheduling and resource allocation. We propose efficient protocols to securely solve such fundamental problem. We analyze the security of our approach and experimentally demonstrate the effectiveness of our approach.


page 1

page 2

page 3

page 4


Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

The design of a good algorithm to solve NP-hard combinatorial approximat...

Gumbel-softmax Optimization: A Simple General Framework for Combinatorial Optimization Problems on Graphs

Many problems in real life can be converted to combinatorial optimizatio...

Constrained Resource Allocation Problems in Communications: An Information-assisted Approach

We consider a class of resource allocation problems given a set of uncon...

Complex matter field universal models with optimal scaling for solving combinatorial optimization problems

We develop a universal model based on the classical complex matter field...

A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise

The aim of this work is to present a meta-heuristically approach of the ...

A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

Real world combinatorial optimization problems such as scheduling are ty...

Solving the Travelling Thief Problem based on Item Selection Weight and Reverse Order Allocation

The Travelling Thief Problem (TTP) is a challenging combinatorial optimi...

Please sign up or login with your details

Forgot password? Click here to reset