2011 Fiscal Year Final Research Report
Advances in Theory and Design Principles of Counting AlgorithmsBased on Polyhedral Combinatorics
Project/Area Number |
21700009
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Single-year Grants |
Research Field |
Fundamental theory of informatics
|
Research Institution | The University of Electro-Communications (2011) Japan Advanced Institute of Science and Technology (2010) Tokyo Institute of Technology (2009) |
Principal Investigator |
OKAMOTO Yoshio 電気通信大学, 大学院・情報理工学研究科, 准教授 (00402660)
|
Project Period (FY) |
2009 – 2011
|
Keywords | アルゴリズム / 離散数学 / 凸多面体 / グラフ / 離散幾何 |
Research Abstract |
Results on counting problems for graphs, counting problems for discrete and computational geometry, and their applications to optimization problems were obtained. For example, the computational complexity of counting the dominating sets in a graph was investigated from the perspective of graph classes, and a polynomial-time algorithm to find a global optimal solution to the distance function maximization was developed by efficiently enumerating all local optimal solutions. These results were presented in refereed international journals and refereed international conferences.
|
Research Products
(46 results)
-
-
-
-
-
-
-
-
-
-
[Journal Article] On problems as hard as CNF-SAT2012
Author(s)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlstrom
-
Journal Title
Proceedings of27th IEEE Conference onComputational Complexity (CCC 2012)
Pages: 74-84
URL
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Untangling a planar graph2009
Author(s)
Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Andreas Spillner, andAlexander Wolff.
-
Journal Title
Discrete& Computational Geometry
Volume: 42
Pages: 542-569
URL
Peer Reviewed
-
-
-
-
[Presentation] Universal point subsets for planar graphs.2012
Author(s)
Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado Giuseppe Liotta Tamara Mchedlidze, Henk Meijer, and Yoshio Okamoto
Organizer
23rd International Symposium on Algorithms and Computation (ISAAC 2012)
Place of Presentation
National Taiwan University (台湾)
Year and Date
2012-12-20
-
-
-
[Presentation] On problems as hard as CNF-SAT2012
Author(s)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlstrom
Organizer
27th IEEE Conference on Computational Complexity (CCC 2012)
Place of Presentation
University of Porto (ポルトガル)
Year and Date
2012-06-26
-
-
-
[Presentation] Dominating set counting in graph classes2011
Author(s)
Shuji Kijima, Yoshio Okamoto, and Takeaki Uno
Organizer
17th Annual International Computing and Combinatorics Conference (COCOON2011)
Place of Presentation
Double Tree by Hilton Hotel Dallas-Richardson (アメリカ)
Year and Date
2011-08-14
-
-
-
-
[Presentation] Minimum and maximum against k lies2010
Author(s)
Michael Hoffmann, Jiri Matousek, Yoshio Okamoto, and Philipp Zumstein
Organizer
12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010)
Place of Presentation
Studentsamskipnaden i Bergen (ノルウェー)
Year and Date
2010-06-22
-
-
-
-