Simplicial Vertex Heuristic in Solving the Railway Arrival and Departure Paths Assignment Problem

Gainanov, Damir; Mladenović, Nenad; Rasskazova, V. A.

doi:10.1007/978-3-030-69625-2_10

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the MIS problem is NP‐hard, 4,5 finding optimal solutions for large graphs is quite difficult. Thus, many researchers have devoted to show approximation algorithms to find near‐optimal solutions for the MIS 6‐9 . However, from the theoretical point of view, we cannot expect very good approximation algorithm for the MIS problem.…”

Section: Introductionmentioning

confidence: 99%

Simple iterative trial search for the maximum independent set problem optimized for the GPUs

Imanaga

Nakano

Yasudo

et al. 2021

Concurrency and Computation

View full text Add to dashboard Cite

An independent set of a graph is a subset of the nodes such that no two nodes in it are adjacent. The maximum independent set (MIS) problem is an optimization problem to find a largest independent set. The main contribution of this article is to introduce a generic iterative trial search algorithm that we call iMIS for finding approximate solutions for the MIS problem. The generic algorithm iMIS is designed so that it can be implemented to run on GPUs very efficiently. Since the performance of the algorithm varies depending on its search strategy, we present a hybrid algorithm that combines three strategies of the iMIS such that best one of them for an input graph is automatically selected. We have implemented our hybrid algorithm to run on a multi‐GPU server with eight NVIDIA A100 GPUs. And evaluated the performance for 66 DIMACS benchmark graphs and 78 random graphs with up to 256M nodes. We have also evaluated the performance of three previously published algorithms for the MIS problem and an approach using Gurobi linear programming solver. The experimental results show that our hybrid algorithm can find larger independent sets for all 144 graphs compared to other methods.

show abstract

Section: Introductionmentioning

confidence: 99%