Work

Note on Polynomial-time Approximation Schemes for Integrated Network Design and Scheduling Problems

Year: 2024

Type: article

Abstract: In the integrated network design and scheduling (INDS) problem, we are asked to repair edges in a graph by using parallel machines so that the performance of the network is recovered by a certain level, and the objective is to minimize the makespan required to finish repairing edges. The main aim of this note is to show that polynomial-time approximation schemes exist for various families of the INDS problems with a constant number of parallel machines, including the problems associated with minimum spanning tree, shortest path, maximum edge-disjoint paths, and maximum-weight matching.

Source: Journal of the Operations Research Society of Japan

DOI: 10.15807/jorsj.67.111

Authors: Kaito Miura, Yusuke Saito, Akiyoshi Shioura

Institution: Tokyo Institute of Technology

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: diamond

Funder: Japan Society for the Promotion of Science