Work

Complexity and Exact Solution of Set-Pair Routing Problem

Year: 2025

Type: article

Abstract: This paper focuses on the set-pair routing problem. The contributions of this paper are as follows: 1) proving the NP-hardness of the set-pair routing problem; and 2) presenting an Integer Linear Programming (ILP) formulation addressing the set-pair routing problem. The proposed method outputs the optimal solution for the benchmarks within the practical run-time.

Source: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

DOI: 10.1587/transfun.2025vlp0001

Author: Yasuhiro TAKASHIMA

Institution: The University of Kitakyushu

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: bronze

OpenAlex ID: W7083181969

FWCI:

Cites: 5

Cited by:

Related to: