| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NLP | 2024-05-09 15:30 |
Kagawa | Kagawa Prefecture Social Welfare Center | An Euclidean Steiner Tree Problem Solver based on Genetic Algorithm and Delaunay Triangulation Liping Zhang, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  NLP2024-6 |
In this report, we propose an approach based on the genetic algorithm and the Delaunay triangulation for solving the Euc... [more] | NLP2024-6 pp.25-30 |
| COMP, IPSJ-AL | 2023-05-11 14:20 |
Hokkaido | Hokkaido University | Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2023-5 |
Given a graph $G = (V, E)$ with a terminal set $W subseteq V$, a vertex subset $S subseteq V$ is an emph{induced Stein... [more] |
COMP2023-5 pp.22-28 |
| COMP, IPSJ-AL | 2022-09-15 11:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
Toward Efficiency Enumeration of Minimal Induced Steiner Subgraphs in Series-Parallel Graphs Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.) COMP2022-11 |
Given a graph ???? = (????, ????) with a terminal set ???? ⊆ ????, a vertex subset ???? ⊆ ???? is an induced Steiner sub... [more] | COMP2022-11 pp.3-9 |
| RCS, IN, NV (Joint) |
2021-05-28 11:20 |
Online | Online | Orientation Estimation of Interests using Approximate Minimum Steiner Tree Urara Kobayashi, Naoki Matsumoto, Kunitake Kaneko (Keio Univ.) IN2021-4 |
In recent years, there has been a tendency to represent information by graph according to services, and it attracts atte... [more] | IN2021-4 pp.19-24 |
| COMP | 2020-10-23 17:05 |
Osaka | Osaka Univ. (Primary: On-site, Secondary: Online) |
Polynomial Delay Enumeration for Steiner Problems Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) COMP2020-17 |
Let $G = (V, E)$ be a undirected graph and let $W subseteq V$ be a set of terminals. A emph{Steiner subgraph} of $(G, W)... [more] | COMP2020-17 pp.39-46 |
| COMP | 2020-03-01 11:30 |
Tokyo | The University of Electro-Communications (Cancelled but technical report was issued) |
[Invited Talk]
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs Takuro Fukunaga (Chuo Univ.) COMP2019-48 |
The problem of finding a minimum-weight connected dominating set (CDS) of a given undirected graph has been studied acti... [more] | COMP2019-48 p.23 |
| CPSY, DC, IPSJ-ARC [detail] | 2019-07-25 13:55 |
Hokkaido | Kitami Civic Hall | A Study on Multiple-error Correction for Matrix-Product Computation Using Steiner Triple System Yuki Katsu, Haruhiko Kaneko (Tokyo Tech) CPSY2019-26 DC2019-26 |
Improving the reliability of matrix multiplication is a very important factor for the technologies in which matrix multi... [more] | CPSY2019-26 DC2019-26 pp.123-127 |
| NLP | 2019-05-10 16:25 |
Oita | J:COM HoltoHALL OITA | A Shortest Path Heuristic Using Network Centralities Misa Fujita (TUS), Takayuki Kimura (NIT), Tohru Ikeguchi (TUS) NLP2019-8 |
A distance network heuristic and a shortest path heuristic are one of the popular construction methods for solving the S... [more] | NLP2019-8 pp.41-46 |
| NLP, NC (Joint) |
2019-01-24 15:00 |
Hokkaido | The Centennial Hall, Hokkaido Univ. | A Genetic Algorithm-Based Method for Finding Approximate Solutions to Minimum Steiner Tree Problems Li-Ping Zhang, Norikazu Takahashi (Okayama Univ.), Zong-Xiao Yang (HAUST) NLP2018-121 |
The Euclidean Steiner Tree Problem (ESTP) is a classical combinatorial optimization problem that appears in various fiel... [more] | NLP2018-121 pp.131-136 |
| DC | 2016-06-20 14:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Relationship between the Number of Fan-Outs and Its Wire-length for a logic gate Taiki Kobayashi, Kazuhiko Iwasaki (Tokyo Metropolitan Univ.) DC2016-12 |
Many analysis and algorithms have been proposed to reduce wire-lengths based on Steiner trees for VLSI layout designs. A... [more] | DC2016-12 pp.13-18 |
| COMP, IPSJ-AL | 2013-05-17 09:55 |
Hokkaido | Otaru University of Commerce | Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals Daiki Hoshika, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-9 |
In this paper we study the maximum packing element-disjoint Steiner tree problem(element-disjoint MaxPST problem, for s... [more] |
COMP2013-9 pp.7-12 |
| IN, MoNA (Joint) |
2012-11-22 09:30 |
Fukuoka | Fukuoka Institute of Technology | Study of Applying Steiner Tree to Energy-Saving Routing Hiroshi Matsuura (NTT) IN2012-116 |
Responding to the recent surge of energy saving requirement of network equipments, the author proposed a routing that us... [more] | IN2012-116 pp.33-38 |
| ICM, IPSJ-IOT, IPSJ-CSEC | 2012-05-11 15:00 |
Akita | Akita University | [Encouragement Talk]
A Proposal of New Steiner Tree Algorithm Applied for P2MP-TE Hiroshi Matsuura (NTT) ICM2012-14 |
The Steiner tree algorithm: MPH (Minimum-cost Path Heuristics) is proposed by Takahashi and Matsuyama in 1980, and has b... [more] | ICM2012-14 pp.153-158 |
| NS, IN (Joint) |
2012-03-09 09:50 |
Miyazaki | Miyazaki Seagia | Selection Scheme of Cut off Links with considering Topology Information for Network Greening Sachiho Iwamura (KIT), Hitomi Tamura (FIT), Kenji Kawahara, Yuji Oie (KIT) IN2011-177 |
In recent years, due to the rapidly grows of the Internet, Network Greening is the important issue. When there are mult... [more] |
IN2011-177 pp.241-246 |
| VLD, CPSY, RECONF, IPSJ-SLDM [detail] | 2012-01-26 15:25 |
Kanagawa | Hiyoshi Campus, Keio University | Evaluation of Improvement Techniques for Placement and Routing on MPLD : a New Reconfigurable Device Ken Taomoto, Masato Inagi, Hideyuki Kawabata, Kazuya Tanigawa, Tetsuo Hironaka (Hiroshima City Univ), Masayuki Sato, Takashi Ishiguro (Taiyo Yuden), Toshiaki Kitamura, Masatoshi Nakamura (Hiroshima City Univ) |
(To be available after the conference date) [more] | |
| ICM, CQ, NS (Joint) |
2011-11-10 09:10 |
Aomori | Hirosaki University | Study of Steiner Algorithms Optimizing Multicast Path Cost and Network Resource Hiroshi Matsuura (NTT) ICM2011-21 |
Multicast services represented by IPTV require high-quality communications assuring their required bandwidths. On the ot... [more] | ICM2011-21 pp.7-12 |
| CAS | 2010-01-29 09:50 |
Kyoto | Kyoudai-Kaikan Bldg. | Effects of Perturbations in Rao's Rectilinear Steiner Arborescence Algorithm Takuya Yamada, Toshihiko Takahashi (Niigata Univ.), Yoshiaki Abe (Canon Imaging Systems) CAS2009-74 |
Minimum rectilinear Steiner arborescence problem (MRSA) is to find an rectilinear Steiner arborescence (RSA) rooted at t... [more] | CAS2009-74 pp.61-64 |
| CQ, NS, ICM (Joint) |
2009-11-13 11:20 |
Ishikawa | Kanazawa Institute of Technology (Ishikawa) | Study of Steiner Tree Algorithms Applied to P2MP TE Hiroshi Matsuura, Naotaka Morita (NTT Corp.), Kazumasa Takami (Soka Univ) ICM2009-32 |
Multicast services represented by IPTV require high-quality communication with guaranteed bandwidth reserved by MPLS pat... [more] | ICM2009-32 pp.35-40 |
| VLD, IPSJ-SLDM | 2009-05-21 10:00 |
Fukuoka | Kitakyushu International Conference Center | A RST Construction Method for Vertices with Maximum Path Length Masafumi Inoue, Yoichi Tomioka (Tokyo Inst. of Tech.), Yukihide Kohira (the Univ. of Aizu), Atsushi Takahashi (Osaka Univ.) VLD2009-4 |
As the wire width decreases, the ratio of routing delay among signal propagation delay increases and the routing delay c... [more] | VLD2009-4 pp.31-36 |
| ICD | 2008-12-12 14:10 |
Tokyo | Tokyo Inst. Tech., Ohokayama Campus, Kokusa-Kouryu-Kaikan | The Development of CAD Design Tools for Via Programmable Logic Device VPEX Yuuichi Kokushou, Masahide Kawarasaki, Kouta Ishibashi, Tomohiro Nishimoto, Kazuma Kitamura (Ritsumeikan Univ), Masaya Yoshikawa (Meijyou Univ), Takeshi Fujino (Ritsumeikan Univ) ICD2008-123 |
We have been studied the user-programmable device called VPEX(Via Programmable logic using Exclusive or array) which can... [more] | ICD2008-123 pp.107-112 |
[Return to Top Page]