3 papers
cs.DS2021
Reallocation Problems with Minimum Completion Time
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino +1
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce…
cs.DS2020
Computing -Labeling with Combined Parameters
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Given a graph, an -labeling of the graph is an assignment from the vertex set to the set of nonnegative integers such that for any pair of vertices $(u,v),|f (u) - f (v…
cs.DS2020
Parameterized Complexity of -Path Packing
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki +6
Given a graph , , and integers and , the \textsc{-Path Packing} problem asks to find vertex-disjoint paths of length that h…