Title :
Using Quantum Search to Solve Dynamic Maximum Network Flow Problem
Author :
Chen, Chi-Yuan ; Lin, Yu-Chuan ; Chou, Yao-Hsin ; Chao, Han-Chieh
Author_Institution :
Dept. of Electr. Eng., Nat. Dong Hwa Univ., Hualien, Taiwan
Abstract :
This paper proposes a quantum search based algorithm to improve the dynamic maximum network flow problem. First, we convert the time-dependent process into time-independent process. Second, we use the draining algorithm to find out the maximum flow and compare with classical algorithms. Third, the draining algorithm is speed up by utilizing quantum search. Finally, we also provide the analysis of time complexity.
Keywords :
computational complexity; quantum computing; draining algorithm; dynamic maximum network flow problem; quantum search based algorithm; time complexity; time-independent process; Algorithm design and analysis; Complexity theory; Heuristic algorithms; Network topology; Quantum computing; Search problems; Topology; Network Flow Problem; Quantum Computing; Quantum Search;
Conference_Titel :
Parallel and Distributed Processing with Applications (ISPA), 2011 IEEE 9th International Symposium on
Conference_Location :
Busan
Print_ISBN :
978-1-4577-0391-1
Electronic_ISBN :
978-0-7695-4428-1
DOI :
10.1109/ISPA.2011.12
