Rchr
J-GLOBAL ID：200901046171528842
Update date: May. 16, 2020
Ono Takao
オノ タカオ | Ono Takao
Contact this researcher
You can send email directly to the researcher.
Research field (3)：
Information networks
, Computer systems
, Information theory
Research theme for competitive and other funds (2)：
充足最大化問題の近似アルゴリズムに関する研究
Study on Approximation Algorithms for Maximum Satisfiability Problem
MISC (25)：
グラフ論的手法を用いた {2, 3}-EC-SNDP に対する近似アルゴリズム. 電子情報通信学会論文誌. 2005. J88-D-I. 1679-1687
An Improved Algorithm for the Nearly Equitable Edge-coloring Problem. IEICE-A(E). 2004. E87-A. 5. 1161-1164
An Improved Algorithm for the Nearly Equitable Edge-coloring Problem. IEICE-A(E). 2004. E87-A. 5. 1161-1164
On Approximation Algorithms for Coloring k-Colorable Graphs. IEICE-A(E). 2003. E86-A. 5. 1046-1051
On Approximation Algorithms for Coloring k-Colorable Graphs. IEICE-A(E). 2003. E86-A. 5. 1046-1051
ｍore...
Books (1)：
組合せ最適化
シュプリンガー・フェアラーク東京 2005
Works (1)：
離散最適化問題に対する近似アルゴリズムに関する研究
2004 - 2004
Professional career (1)：
博士(工学)
Work history (1)：
Nagoya University Graduate School of Information Science, Granduate School of Information Science Assistant Professor
Association Membership(s) (1)：
情報処理学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in
researchmap
.
For details, see here
.
Return to Previous Page
TOP
BOTTOM
