Tomomi Matsui

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 24

Top Topics

Network Design Problem

Quadratic Optimization

Weighted Voting Games

Top Venues

J. Appl. Probab.

Inf. Process. Lett.

Publications

Yuko Kuroki, Tomomi Matsui
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: Star metric case. Discret. Appl. Math. 349 (2024)
Koichi Fujii, Tomomi Matsui
Solving break minimization problems in mirrored double round-robin tournament with QUBO solver. CoRR (2023)
Yuto Ushioda, Masato Tanaka, Tomomi Matsui
Monte Carlo Methods for the Shapley-Shubik Power Index. Games 13 (3) (2022)
Masato Tanaka, Tomomi Matsui
Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games. Math. Soc. Sci. 115 (2022)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive approximation algorithms for modularity maximization. J. Comput. Syst. Sci. 117 (2021)
Akihiro Kawana, Tomomi Matsui
Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games. CoRR (2021)
Masato Tanaka, Tomomi Matsui
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization. CoRR (2021)
Yuto Ushioda, Masato Tanaka, Tomomi Matsui
Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games. CoRR (2021)
Masato Tanaka, Tomomi Matsui
Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games. CoRR (2021)
Yoichi Izunaga, Tomomi Matsui, Yoshitsugu Yamamoto
A doubly nonnegative relaxation for modularity density maximization. Discret. Appl. Math. 275 (2020)
Yusei Fujimori, Yasushi Kawase, Tomomi Matsui, Akiyoshi Shioura
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. Inf. Process. Lett. 162 (2020)
Yuko Kuroki, Tomomi Matsui
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. J. Graph Algorithms Appl. 23 (1) (2019)
Ryuta Tamura, Ken Kobayashi, Yuichi Takano, Ryuhei Miyashiro, Kazuhide Nakata, Tomomi Matsui
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor. J. Glob. Optim. 73 (2) (2019)
Yuko Kuroki, Tomomi Matsui
A constant-ratio approximation algorithm for a class of hub-and-spoke network design problems and metric labeling problems: star metric case. CoRR (2018)
Tomomi Matsui, Ano Katsunori
Compare the ratio of symmetric polynomials of odds to one and stop. J. Appl. Probab. 54 (1) (2017)
Yuko Kuroki, Tomomi Matsui
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. WALCOM (2017)
Yuko Kuroki, Tomomi Matsui
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. CoRR (2016)
Tomomi Matsui, Ano Katsunori
Lower Bounds for Bruss' Odds Problem with Multiple Stoppings. Math. Oper. Res. 41 (2) (2016)
Tomomi Matsui, Takayoshi Hamaguchi
Characterizing a Set of Popular Matchings Defined by Preference Lists with Ties. CoRR (2016)
Yukihide Kohira, Atsushi Takahashi, Tomomi Matsui, Chikaaki Kodama, Shigeki Nojima, Satoshi Tanaka
Manufacturability-aware mask assignment in multiple patterning lithography. APCCAS (2016)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive Approximation Algorithms for Modularity Maximization. ISAAC (2016)
Yasushi Kawase, Tomomi Matsui, Atsushi Miyauchi
Additive Approximation Algorithms for Modularity Maximization. CoRR (2016)
Tomomi Matsui, Rudolf Scheifele
A linear time algorithm for the unbalanced Hitchcock transportation problem. Networks 67 (2) (2016)
Yukihide Kohira, Tomomi Matsui, Yoko Yokoyama, Chikaaki Kodama, Atsushi Takahashi, Shigeki Nojima, Satoshi Tanaka
Fast mask assignment using positive semidefinite relaxation in LELECUT triple patterning lithography. ASP-DAC (2015)
Tomomi Matsui, Ano Katsunori
A Note on a Lower Bound for the Multiplicative Odds Theorem of Optimal Stopping. J. Appl. Probab. 51 (3) (2014)
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
Fractional programming formulation for the vertex coloring problem. Inf. Process. Lett. 114 (12) (2014)
Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi
Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography. ISAAC (2014)
Tomomi Matsui, Hiroyoshi Miwa
Method for Finding Protected Nodes for Robust Network against Node Failures. INCoS (2014)
Tomomi Matsui, Noriyoshi Sukegawa, Atsushi Miyauchi
Fractional programming formulation for the vertex coloring problem. CoRR (2014)
Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
A 2.75-approximation algorithm for the unconstrained traveling tournament problem. Ann. Oper. Res. 218 (1) (2014)
Tomomi Matsui
NP-completeness of Arithmetical Restorations. Inf. Media Technol. 8 (3) (2013)
Tomomi Matsui
NP-completeness of Arithmetical Restorations. J. Inf. Process. 21 (3) (2013)
Ryuhei Miyashiro, Tomomi Matsui, Shinji Imahori
An approximation algorithm for the traveling tournament problem. Ann. Oper. Res. 194 (1) (2012)
Tomomi Matsui, Yuichiro Miyamoto
Characterizing Delaunay Graphs via Fixed Point Theorem. CCCG (2012)
Naoyuki Kamiyama, Tomomi Matsui
Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. CATS (2011)
Ryuta Ando, Tomomi Matsui
Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane. ISAAC (2011)
Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem CoRR (2011)
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui
An Improved Approximation Algorithm for the Traveling Tournament Problem. Algorithmica 61 (4) (2011)
Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui
Improved Approximation Algorithms for Firefighter Problem on Trees. IEICE Trans. Inf. Syst. (2) (2011)
Hirotatsu Kobayashi, Tomomi Matsui
Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference Lists. Algorithmica 58 (1) (2010)
Tomomi Matsui
Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists. OR (2010)
Hirotatsu Kobayashi, Tomomi Matsui
Successful Manipulation in Stable Marriage Model with Complete Preference Lists. IEICE Trans. Inf. Syst. (2) (2009)
Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui
An Improved Approximation Algorithm for the Traveling Tournament Problem. ISAAC (2009)
Hadas Shachnai, Lisa Zhang, Tomomi Matsui
A note on generalized rank aggregation. Inf. Process. Lett. 109 (13) (2009)
Masaru Iwasa, Hiroo Saito, Tomomi Matsui
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. Discret. Appl. Math. 157 (9) (2009)
Yuichiro Miyamoto, Tomomi Matsui
Perfectness and imperfectness of unit disk graphs on triangular lattice points. Discret. Math. 309 (9) (2009)
Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura
A study of the quadratic semi-assignment polytope. Discret. Optim. 6 (1) (2009)
Yusuke Kuroki, Tomomi Matsui
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discret. Appl. Math. 157 (9) (2009)
Shuji Kijima, Tomomi Matsui
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Ann. Oper. Res. 162 (1) (2008)
Shuji Kijima, Tomomi Matsui
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. SIAM J. Comput. 38 (4) (2008)
Mikio Yamamoto, Jyunya Norimatsu, Mitsuru Koshikawa, Takahiro Fukutomi, Taku Nishio, Kugatsu Sadamitsu, Takehito Utsuro, Masao Utiyama, Shunji Umetani, Tomomi Matsui
Diversion of Hierarchical Phrases as Reordering Templates. NTCIR (2008)
Hadas Shachnai, Lisa Zhang, Tomomi Matsui
Exact algorithms for the master ring problem. Networks 52 (2) (2008)
Shuji Kijima, Tomomi Matsui
Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29 (2) (2006)
Ryuhei Miyashiro, Tomomi Matsui
Semidefinite programming based approaches to the break minimization problem. Comput. Oper. Res. 33 (2006)
Nobutomo Fujiwara, Shinji Imahori, Tomomi Matsui, Ryuhei Miyashiro
Constructive Algorithms for the Constant Distance Traveling Tournament Problem. PATAT (2006)
Masaru Iwasa, Hiroo Saito, Tomomi Matsui
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks. Electron. Notes Discret. Math. 27 (2006)
Yuichiro Miyamoto, Tomomi Matsui
Approximation Algorithms for Minimum Span Channel Assignment Problems. AAIM (2006)
Shu Yamada, Michiyo Matsui, Tomomi Matsui, Dennis K. J. Lin, Takenori Takahashi
A general construction method for mixed-level supersaturated design. Comput. Stat. Data Anal. 50 (1) (2006)
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
Algorithms for Computing Geometric Measures of Melodic Similarity. Comput. Music. J. 30 (3) (2006)
Yusuke Kuroki, Tomomi Matsui
Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem. Electron. Notes Discret. Math. 27 (2006)
Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui
Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
Ayami Suzuka, Ryuhei Miyashiro, Akiko Yoshise, Tomomi Matsui
Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling. AAIM (2005)
Masashi Kiyomi, Takeaki Uno, Tomomi Matsui
Efficient Algorithms for the Electric Power Transaction Problem. WINE (2005)
Ryuhei Miyashiro, Tomomi Matsui
A polynomial-time algorithm to find an equitable home-away assignment. Oper. Res. Lett. 33 (3) (2005)
Yuichiro Miyamoto, Tomomi Matsui
Multicoloring unit disk graphs on triangular lattice points. SODA (2005)
Shuji Kijima, Tomomi Matsui
Approximate/perfect samplers for closed Jackson networks. WSC (2005)
Yuichiro Miyamoto, Tomomi Matsui
Perfectness and Imperfectness of the kth Power of Lattice Graphs. AAIM (2005)
Shuji Kijima, Tomomi Matsui
Contingency Tables. IEICE Trans. Inf. Syst. (2) (2004)
Tomomi Matsui, Yasuko Matsui, Yoko Ono
Random generation of 2 times 2 times ... times 2 times J contingency tables. Theor. Comput. Sci. 326 (1-3) (2004)
Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint
Computing the Similarity of two Melodies. CCCG (2003)
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution. ISAAC (2003)
Ryuhei Miyashiro, Tomomi Matsui
Notes on Equitable Round-Robin Tournaments. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2002)
Hiroo Saito, Shiro Matuura, Tomomi Matsui
A Linear Relaxation for Hub Network Design Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2002)
Ryuhei Miyashiro, Hideya Iwasaki, Tomomi Matsui
Characterizing Feasible Pattern Sets with a Minimum Number of Breaks. PATAT (2002)
Shiro Matuura, Tomomi Matsui
63-Approximation Algorithm for MAX DICUT. RANDOM-APPROX (2001)
Yasuko Matsui, Tomomi Matsui
NP-completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263 (1-2) (2001)
Tomomi Matsui, Takahiro Watanabe
Sealed Bid Mulit-object Auctions with Necessary Bundles and Its Application to Spectrum Auctions. PRIMA (2001)
Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7 (3) (2000)
Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices. SWAT (2000)
Masashi Kiyomi, Tomomi Matsui
Integer Programming Based Algorithms for Peg Solitaire Problems. Computers and Games (2000)
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
A fast bipartite network flow algorithm for selective assembly. Oper. Res. Lett. 22 (4-5) (1998)
Tomomi Matsui
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs. JCDCG (1998)
Tomomi Matsui
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs. Algorithmica 18 (4) (1997)
Tomomi Matsui
NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9 (2) (1996)
Tomomi Matsui
The Minimum Spanning Tree Problem on a Planar Graph. Discret. Appl. Math. 58 (1) (1995)
Tomomi Matsui, Sunao Tamura
Adjacency on Combinatorial Polyhedra. Discret. Appl. Math. 56 (2-3) (1995)
Maiko Shigeno, Yasufumi Saruwatari, Tomomi Matsui
An Algorithm for Fractional Assignment Problems. Discret. Appl. Math. 56 (2-3) (1995)
Yasuko Matsui, Tomomi Matsui
Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs. Combinatorics and Computer Science (1995)
Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe
Algorithms for finding a Kth best valued assignment. Discret. Appl. Math. 50 (3) (1994)
Yasufumi Saruwatari, Tomomi Matsui
-Best Solutions to the Chinese Postman Problem. SIAM J. Optim. 3 (4) (1993)
Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. Discret. Appl. Math. 47 (3) (1993)
Komei Fukuda, Tomomi Matsui
Finding all minimum-cost perfect matchings in Bipartite graphs. Networks 22 (5) (1992)
Hiroshi Konno, Yasutoshi Yajima, Tomomi Matsui
Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Glob. Optim. 1 (1) (1991)