2016 Fiscal Year Final Research Report
Approximation algorithms for set cover problems with graph structures
| Project/Area Number |
25330026
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Mathematical informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
ZHAO LIANG 京都大学, 総合生存学館, 准教授 (90344902)
|
|---|
| Project Period (FY) |
2013-04-01 – 2017-03-31
|
| Keywords | 支配集合 / 集合被覆 / distance dominating / network algorithm |
|---|
| Outline of Final Research Achievements |
Given a graph, let us define the domination area of a vertex v by the set of vertexes within distance k from v. This research considers to find a minimum set of vertexes that dominates all or specified ratio of vertexes. For a k>=2 and large scale networks, based on the idea to improve by utilizing the graph structure, this study designed some new linear-time algorithms for some classes of graphs. Empirical results show that proposed methods improve from previous studies. Finally, the algorithms are applied to some social problems as well.
|
| Free Research Field |
アルゴリズム
|
