DocumentCode :
3137479
Title :
Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems
Author :
Watanabe, Toshio
Author_Institution :
Grad. Sch. of Eng., Hiroshima Univ., Higashi-Hiroshima, Japan
fYear :
2012
fDate :
5-7 Dec. 2012
Firstpage :
19
Lastpage :
20
Abstract :
The paper shows summary of the author´s research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at presentation.
Keywords :
computational complexity; graph theory; optimisation; algorithm design; combinatorial optimization problems; computational complexity analysis; space limitation; Algorithm design and analysis; Automata; Educational institutions; Heuristic algorithms; Petri nets; Time complexity; Wiring; Algorithm Design; Combinatorial Problems; Computational Complexity Analysis; Graph Connectivity; Petri Nets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking and Computing (ICNC), 2012 Third International Conference on
Conference_Location :
Okinawa
Print_ISBN :
978-1-4673-4624-5
Type :
conf
DOI :
10.1109/ICNC.2012.12
Filename :
6424538
Link To Document :
بازگشت