Art

J-GLOBAL ID：202002288456500702   Reference number：20A2114926

The computational complexity of the gear placement problem

歯車配置問題の計算量

Author (6)： HAMA Vitor Mitsuo FUKUSHIGUE (Department of Mathematical Informatics, Nagoya University) ,  KANAZAWA Shogo (Department of Mathematical Informatics, Nagoya University) ,  HU Yannan (Department of Applied Mathematics, Tokyo University of Science) ,  IMAHORI Shinji (Faculty of Science and Engineering, Chuo University) ,  ONO Hirotaka (Department of Mathematical Informatics, Nagoya University) ,  YAGIURA Mutsunori (Department of Mathematical Informatics, Nagoya University)
Material： Journal of Advanced Mechanical Design, Systems, and Manufacturing (Web)  (J Adv Mech Des Syst Manuf (Web))
Volume： 14  Issue： 5  Page： JAMDSM0069(J-STAGE)  Publication year： 2020 
JST Material Number： U0027A  ISSN： 1881-3054  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： gear ,  *location problem ,  *computational complexity ,  NP hard ,  gear box
Semi thesaurus term： gear ,  gear box

Author keywords (4)： Computational complexity ,  Gear placement problem ,  NP-hard ,  Reduction

JST classification (1)： Numerical computation  (JE02000J)

Reference (12)：

• Biedl, T. C., New lower bounds for orthogonal graph drawings, in F. J. Brandenburg (ed.), Graph Drawing, Vol. 1027 of Lecture Notes in Computer Science, Springer (1996), pp.28-39.
• Birgin, E. G. and Gentil, J. M., New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, Computers & Operations Research, Vol.37, No.7 (2010), pp.1318-1327.
• Castillo, I., Kampas, F. J. and Pintér, J. D., Solving circle packing problems by global optimization: numerical results and industrial applications, European Journal of Operational Research, Vol.191, No.3 (2008), pp.786-802.
• Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), WH Freeman.
• Garey, M. R., Johnson, D. S. and Tarjan, R. E., The planar Hamiltonian circuit problem is NP-complete, SIAM Journal on Computing, Vol.5, No.4 (1976), pp.704-714.

Terms in the title (3)： 歯車 ,  配置問題 ,  計算量