| 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.) |
(To be available after the conference date) [more] | |
| 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 |
| 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 |
| 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 |
| NS, IN (Joint) |
2008-03-06 11:50 |
Okinawa | Bankoku Shinryokan | Multicast Tree Construction Algorithms for All Optical Networks in Delay Constraint Environments Tsutomu Makabe, Toyofumi Takenaka (Nihon Univ.) NS2007-160 |
We propose novel tree construction algorithms for multicast communication in photonic networks. Since multicast communic... [more] | NS2007-160 pp.167-172 |
| COMP | 2007-03-05 15:35 |
Tokyo | The University of Electro-Communications | Approximation algorithms for the degree 3 terminal steiner tree problem with restricted weights Kazuma Naito (titech) |
The steiner tree problem asks for a smallest tree spanning a given subset $R$ of distinguished vertices. We consider a ... [more] |
COMP2006-57 pp.51-58 |
| PN, NS (Joint) |
2006-12-14 13:15 |
Aichi | Nagoya Univ. | Multicast Tree Construction Algorithms using the Number of Available Wavelengths in All-Optical Networks Tsutomu Makabe, Toyofumi Takenaka (Nihon Univ.) PN2006-39 |
We propose a novel tree construction algorithm for multicast communication in photonic networks. Since multicast communi... [more] | PN2006-39 pp.1-4 |
| MSS | 2006-07-26 10:25 |
Kyoto | Kyoto Institute of Technology | An Optimal Share Transfer Problem on Secret Sharing Storage Systems Toshiyuki Miyamoto, Sadatoshi Kumagai (Osaka Univ.) |
We have been proposing and developing a secure and reliable distributed storage system, which uses the secret sharing sc... [more] | CST2006-11 pp.7-12 |
[Return to Top Page]