14 citations · 23 across the 5 of their papers we have counts for
5 papers
A 1+O(1/N) approximation algorithm for TTP(2)
Shinji Imahori
The traveling tournament problem is a well-known benchmark problem of the sports scheduling. We propose an approximation algorithm for the traveling tournament problem with the con…
Escherization with Generalized Distance Functions Focusing on Local Structural Similarity
Yuichi Nagata, Shinji Imahori
The Escherization problem involves finding a closed figure that tiles the plane that is most similar to a given goal figure. In Koizumi and Sugihara's formulation of the Escherizat…
An Efficient Algorithm for the Escherization Problem in the Polygon Representation
Yuichi Nagata, Shinji Imahori
In the Escherization problem, given a closed figure in a plane, the objective is to find a closed figure that is as close as possible to the input figure and tiles the plane. Koizu…
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…
Colorful Strips
G. Aloupis, J. Cardinal, S. Collette +6
Given a planar point set and an integer , we wish to color the points with colors so that any axis-aligned strip containing enough points contains all colors. The goal is to…