Private list of old manuscripts.
- 2007
-
METR 2007-03
- Yusuke KUROKI and Tomomi MATSUI,
- Approximation Algorithm for Multidimensional Assignment Problem Minimizing the Sum of Squared Errors, 20pp., January 2007.
- 2006
-
METR2006-05
- Ayami SUZUKA and Ryuhei MIYASHIRO and Akiko YOSHISE and Tomomi MATSUI,
- The Home-Away Assignment Problems and Break Minimization/Maximization Problems in Sports Scheduling, January 2006.
-
METR 2006-09
- Tomomi MATSUI, Mitsuo MOTOKI, Naoyuki KAMATANI and Shuji KIJIMA,
- Polynomial Time Approximate/Perfect Samplers for Discretized Dirichlet Distribution, 30pp., January 2006.
-
METR 2006-34
- Shuji KIJIMA and Tomomi MATSUI,
- Randomized Approximation Scheme and Perfect Sampler for Closed Jackson Networks with Multiple Servers, 18pp., June 2006.
-
METR 2006-48
- Nobutomo FUJIWARA, Shinji IMAHORI and Tomomi MATSUI and Ryuhei MIYASHIRO,
- Constructive Algorithms for the Constant Distance Traveling Tournament Problem, 10pp., August 2006.
-
METR 2006-52
- Masaru IWASA, Hiroo SAITO and Tomomi MATSUI,
- Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks and Related Metric Labeling Problems, 18pp., October 2006.
- 2005
-
METR2005-07
- Ayami SUZUKA and Ryuhei MIYASHIRO and Akiko YOSHISE and Tomomi MATSUI,
- Semidefinite Programming Based Approaches to Home-away
Assignment Problems in Sports Scheduling, 11pp., February 2005.
-
METR2005-12
- Shuji KIJIMA and Tomomi MATSUI,
- Polynomial-time Randomized Approximation and Perfect Sampler for Closed Jackson Networks with Single Servers, 19pp., May 2005.
-
METR 2005-27
- Ayami SUZUKA and Ryuhei MIYASHIRO and Akiko YOSHISE and Tomomi MATSUI,
- Dependent Randomized Rounding to the Home-away Assignment Problem in Sports Scheduling, 9pp., September 2005.
-
METR 2005-28
- Yuichiro MIYAMOTO and Tomomi MATSUI,
- Approximation Algorithms for Minimum Span Channel Assignment Problems, 11pp., September 2005.
- 2004
-
METR 2004-29
- Yuichiro MIYAMOTO and Tomomi MATSUI,
- Multicoloring Unit Disk Graphs on Triangular Lattice Points, 14pp., May 2004.
-
METR 2004-32
- Hiroo SAITO and Tetsuya FUJIE and Tomomi MATUSI and Shiro MATUURA,
- The Quadratic Semi-Assignment Polytope, 22pp., June 2004.
- 2003
-
METR 2003-01
- Shuji KIJIMA and Tomomi MATSUI,
- Approximate Counting Scheme for mxn Contingency Tables, 11pp., January 2003.
-
METR 2003-02
- Tomomi MATSUI and Takahiro WATANABE,
- Multi-Object Auctions with a Single Bundle Bidding for Perfect Complements, January 2003.
-
METR 2003-03
- Tomomi MATSUI and Yasuko MATSUI and Yoko ONO,
- Random Generation of 2x2x...xJ Contingency Tables, January 2003.
-
METR 2003-10
- Tomomi MATSUI and Mitsuo MOTOKI and Naoyuki KAMATANI,
- Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution, 12pp., February 2003.
-
METR 2003-15
- Shuji KIJIMA and Tomomi MATSUI,
- Polynomial Time Perfect Sampling Algorithm for Two-rowed Contingency Tables, 12pp., April 2003.
-
METR 2003-17
- Tomomi MATSUI and Shuji KIJIMA,
- Polynomial Time Perfect Sampler for Discretized Dirichlet Distribution, 17pp., April 2003.
-
melody.ps ,
- Computing a Geometric Measure of the Similarity Between two Melodies,
- Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nunez, David Rappaport and Godfried Toussaint, in Proceedings of the 15th Canadian Conference on Computational Geometry (CCCG'03) , Dalhousie University, Halifax, August 11-13, 2003, pp. 81-84.
-
METR 2003-28
- Ryuhei MIYASHIRO and Tomomi MATSUI,
- Semidefinite Programming Based Approaches to the Break Minimization Problem, 10pp., August 2003.
-
METR 2003-29
- Ryuhei MIYASHIRO and Tomomi MATSUI,
- Round-Robin Tournaments with a Small Number of Breaks, 9pp., August 2003.
-
METR 2003-34
- Yuichiro MIYAMOTO and Tomomi MATSUI,
- Linear Time Approximation Algorithm for Multicoloring Lattice Graphs with Diagonals, October 2003.
- 2002
-
METR 2002-14
- Ryuhei MIYASHIRO, Hideya IWASAKI and Tomomi MATSUI,
- Characterizing Feasible Pattern Sets with a Minimum Number of Breaks, 22pp., December 2002.
-
PRIMA
- Tomomi MATSUI and Takahiro Watanabe
- Sealed bid multi-object auctions with
necessary bundles and its application to spectrums auctions
- 2001
-
METR2001-01
- Shiro MATUURA and Tomomi MATSUI,
- 0.863-Approximation Algorithm For MAX DICUT, 10pp., April 2001.
-
METR 2001-03
- Shiro Matuura and Tomomi Matsui,
- 0.935-Approximation Randomized Algorithm for MAX 2SAT and Its Derandomization, 10pp, September 2001.
- old papers
-
METR98-05 ,
(abstract)
- Shu Yamada and Tomomi MATSUI
- Optimality of Mixed-level Supersaturated Designs
-
METR98-01 ,
(abstract)
- Yasuko MATSUI and Tomomi MATSUI
- NP-completeness for calculating power indices of weighted majority games
- ps file ,
dvi file
- Tomomi MATSUI
- A note on mixed level supersaturated designs (abstract)
-
alltree12
(abstract)
(revised version of METR93-08 )
- Tomomi MATSUI
- A flexible algorithm for generating all the spanning trees
in undirected graphs
- Algorithmica, Vol.18 (1997), pp.530-544.
-
u-flow2 ,
(abstract)
- Tomomi MATSUI
- Is a given flow uncontrollable?,
- IEICE Trans. Fundamentals, Vol.E79-A (1996) pp.448-451.
-
METR95-13 ,
(abstract)
- Tomomi MATSUI
- NP-hardness of Linear Multiplicative Programming and Related Problems
- Journal of Global Optimization, Vol.9 (1996), pp.113-119.
-
METR95-09 ,
(abstract)
- Yasuko MATSUI and Tomomi MATSUI
- An Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs
- Lecture Notes in Computer Science, Springer-Verlag. 1120 (1996) pp.18-26.
-
METR94-02
- Tomomi MATSUI
- A linear time algorithm for the minimum spanning tree problem
on a planar graph
- Discrete Applied Mathematics, 56 (1995), pp311-321.
-
METR93-08
- Tomomi MATSUI
- An algorithm for finding all the spanning trees in
undirected graphs
-
METR93-03
- Tomomi MATSUI and Sunao TAMURA
- Adjacency on combinatorial Polyhedra
- Discrete Applied Mathematics, 56(1995), 311-321.
-
METR92-16
- Maiko SHIGENO, Yasufumi SARUWATARI and Tomomi MATSUI
- An algorithm for fractional assignment problems
- Discrete Applied Mathematics, 56(1995), 333-343.
-
METR92-14
- Tomomi MATSUI, Yasufumi SARUWATARI and Maiko SHIGENO
- An analysis of Dinkelbach's algorithm for
0-1 fractional programming problems
Tom's Home Page