Learning to Find Hard Instances of Graph Problems

02/26/2019
by   Ryoma Sato, et al.
8

Finding hard instances, which need a long time to solve, of graph problems such as the graph coloring problem and the maximum clique problem, is important for (1) building a good benchmark for evaluating the performance of algorithms, and (2) analyzing the algorithms to accelerate them. The existing methods for generating hard instances rely on parameters or rules that are found by domain experts; however, they are specific to the problem. Hence, it is difficult to generate hard instances for general cases. To address this issue, in this paper, we formulate finding hard instances of graph problems as two equivalent optimization problems. Then, we propose a method to automatically find hard instances by solving the optimization problems. The advantage of the proposed algorithm over the existing rule based approach is that it does not require any task specific knowledge. To the best of our knowledge, this is the first non-trivial method in the literature to automatically find hard instances. Through experiments on various problems, we demonstrate that our proposed method can generate instances that are a few to several orders of magnitude harder than the random based approach in many settings. In particular, our method outperforms rule-based algorithms in the 3-coloring problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2019

Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms

The design of a good algorithm to solve NP-hard combinatorial approximat...
research
04/24/2020

JCOL: A Java package for solving the graph coloring problem

The graph coloring problem aims at assigning colors to the nodes of a gr...
research
04/22/2022

Learning for Spatial Branching: An Algorithm Selection Approach

The use of machine learning techniques to improve the performance of bra...
research
11/02/2018

Generating Hard Instances for Robust Combinatorial Optimization

While research in robust optimization has attracted considerable interes...
research
06/27/2012

Incorporating Domain Knowledge in Matching Problems via Harmonic Analysis

Matching one set of objects to another is a ubiquitous task in machine l...
research
04/07/2022

Learning to Solve Travelling Salesman Problem with Hardness-adaptive Curriculum

Various neural network models have been proposed to tackle combinatorial...
research
02/15/2019

A Comparison of Random Task Graph Generation Methods for Scheduling Problems

How to generate instances with relevant properties and without bias rema...

Please sign up or login with your details

Forgot password? Click here to reset