DeepAI AI Chat
Log In Sign Up

Experiments with graph convolutional networks for solving the vertex p-center problem

06/01/2021
by   Elisabeth Gaar, et al.
0

In the last few years, graph convolutional networks (GCN) have become a popular research direction in the machine learning community to tackle NP-hard combinatorial optimization problems (COPs) defined on graphs. While the obtained results are usually still not competitive with problem-specific solution approaches from the operations research community, GCNs often lead to improvements compared to previous machine learning approaches for classical COPs such as the traveling salesperson problem (TSP). In this work we present a preliminary study on using GCNs for solving the vertex p-center problem (PCP), which is another classic COP on graphs. In particular, we investigate whether a successful model based on end-to-end training for the TSP can be adapted to a PCP, which is defined on a similar 2D Euclidean graph input as the usually used version of the TSP. However, the objective of the PCP has a min-max structure which could lead to many symmetric optimal, i.e., ground-truth solutions and other potential difficulties for learning. Our obtained preliminary results show that indeed a direct transfer of network architecture ideas does not seem to work too well. Thus we think that the PCP could be an interesting benchmark problem for new ideas and developments in the area of GCNs.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/25/2018

Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search

We present a learning-based approach to computing solutions for certain ...
10/20/2022

Overlapping Community Detection using Dynamic Dilated Aggregation in Deep Residual GCN

Overlapping community detection is a key problem in graph mining. Some r...
04/08/2021

QD-GCN: Query-Driven Graph Convolutional Networks for Attributed Community Search

Recently, attributed community search, a related but different problem t...
04/04/2022

Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks

The minimum cost multicut problem is the NP-hard/APX-hard combinatorial ...
05/08/2020

Geometric graphs from data to aid classification tasks with graph convolutional networks

Classification is a classic problem in data analytics and has been appro...
06/04/2019

An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

This paper introduces a new learning-based approach for approximately so...