Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
Publication
, Preprint
Chakrabarti, S; Herman, D; Ozgul, G; Zhu, S; Augustino, B; Hao, T; He, Z; Shaydulin, R; Pistoia, M
October 30, 2024
Duke Scholars
Publication Date
October 30, 2024
Citation
APA
Chicago
ICMJE
MLA
NLM
Chakrabarti, S., Herman, D., Ozgul, G., Zhu, S., Augustino, B., Hao, T., … Pistoia, M. (2024). Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over
Markov Chain Search for Combinatorial Optimization.
Chakrabarti, Shouvanik, Dylan Herman, Guneykan Ozgul, Shuchen Zhu, Brandon Augustino, Tianyi Hao, Zichang He, Ruslan Shaydulin, and Marco Pistoia. “Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over
Markov Chain Search for Combinatorial Optimization,” October 30, 2024.
Chakrabarti S, Herman D, Ozgul G, Zhu S, Augustino B, Hao T, et al. Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over
Markov Chain Search for Combinatorial Optimization. 2024.
Chakrabarti, Shouvanik, et al. Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over
Markov Chain Search for Combinatorial Optimization. 30 Oct. 2024.
Chakrabarti S, Herman D, Ozgul G, Zhu S, Augustino B, Hao T, He Z, Shaydulin R, Pistoia M. Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over
Markov Chain Search for Combinatorial Optimization. 2024.
Publication Date
October 30, 2024