2013 Fiscal Year Final Research Report
A Study of Approximation Algorithms for Graph Optimization Problems.
| Project/Area Number |
24700016
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tottori University of Environmental Studies |
|---|
Principal Investigator |
NAGOYA Takayuki 鳥取環境大学, 人間形成教育センター, 准教授 (90349796)
|
|---|
| Project Period (FY) |
2012-04-01 – 2014-03-31
|
| Keywords | アルゴリズム理論 / グラフ理論 / 組合せ最適化 |
|---|
| Research Abstract |
In this study, we proposed algorithms for some graph optimization problems. It is known that the problem to recover drawing order from static handwritten line images is modeled by a graph optimization problem. We designed a heuristic algorithm for this problem by using spline curve. Also, we recursively define a class of graphs those represent some line images. Then, we proposed a linear-time algorithm for the class. We also investigated differential approximation for k-VRP(1,2) and MaxTSP.
|
