14 citations · 49 across the 14 of their papers we have counts for
4 papers · 1 filter
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
Yuko Kuroki, Tomomi Matsui
We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation…
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties
Tomomi Matsui, Takayoshi Hamaguchi
In this paper, we give a simple characterization of a set of popular matchings defined by preference lists with ties. By employing our characterization, we propose a polynomial tim…
Fractional programming formulation for the vertex coloring problem
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors w…
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem
Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveli…